Java || Solution
Code
\n# Code\n```java []\nimport java.util.*;\n\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> freqMap = new HashMap<>();\n        int n = nums.length;\n\n        // Count the frequency of each element in all arrays\n        for (int[] arr : nums) {\n            for (int num : arr) {\n                freqMap.put(num, freqMap.getOrDefault(num, 0) + 1);\n            }\n        }\n\n        // Filter elements that occur in all arrays\n        List<Integer> result = new ArrayList<>();\n        for (Map.Entry<Integer, Integer> entry : freqMap.entrySet()) {\n            if (entry.getValue() == n) {\n                result.add(entry.getKey());\n            }\n        }\n\n        Collections.sort(result);\n        return result;\n    }\n}\n```
['Java']