✅100% Easy Java Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n![download.png](https://assets.leetcode.com/users/images/b5a56023-fcae-487f-9530-a2acad56fab3_1688804872.161732.png)\n```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        List<Integer>list=new ArrayList<>();\n        for(int j=0;j<nums[0].length;j++)\n        {\n            list.add(nums[0][j]);\n        }\n\n        for(int i=1;i<nums.length;i++)\n        {\n          List<Integer>list1=new ArrayList<>();\n          for(int j=0;j<nums[i].length;j++)\n          {\n              if(list.contains(nums[i][j]))\n              list1.add(nums[i][j]);\n          }\n          list=list1;\n        }\n        Collections.sort(list);\n        return list;\n    }\n}\n```
['Java']