public class Solution {
    public int maxDistance(List<List<Integer>> arrays) {
        int min = arrays.get(0).get(0);
        int max = arrays.get(0).get(arrays.get(0).size() - 1);
        int result = 0;
        for (int i = 1; i < arrays.size(); i++) {
            List<Integer> current = arrays.get(i);
            result = Math.max(result, Math.abs(max - current.get(0)));
            result = Math.max(result, Math.abs(current.get(current.size() - 1) - min));
            min = Math.min(min, current.get(0));
            max = Math.max(max, current.get(current.size() - 1));
        }
        return result;
    }
}