Java Solution
Code\n\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> map = new HashMap<>();\n        for (int i = 0; i
# Code\n```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> map = new HashMap<>();\n        for (int i = 0; i < nums.length; i++) {\n            for (int j = 0; j < nums[i].length; j++) {\n                if (map.containsKey(nums[i][j])) {\n                    map.put(nums[i][j], map.get(nums[i][j]) + 1);\n                } else {\n                    map.put(nums[i][j], 1);\n                }\n            }\n        }\n        List<Integer> list = new ArrayList<>();\n        for (Integer key : map.keySet()) {\n            if (map.get(key) == nums.length) {\n                list.add(key);\n            }\n        }\n        Collections.sort(list);\n        return list;\n    }\n}\n```
['Java']