Java Simple Brute Force Solution
\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        ArrayList<Integer> arrList = new ArrayList<Integer>();\n        List<Integer>
```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        ArrayList<Integer> arrList = new ArrayList<Integer>();\n        List<Integer> resList = new ArrayList<Integer>();\n        \n        for(int i = 0; i < nums.length; i++){\n            for(int j = 0; j < nums[i].length; j++){\n                arrList.add(nums[i][j]); // adding all the elements of nums in arrList\n            }\n        }\n        \n        int numLength = nums.length;\n        int count = 0;\n        \n        for(int i = 0; i < nums[0].length; i++){\n            for(int j = 0; j < arrList.size(); j++){\n                if(nums[0][i] == arrList.get(j)){\n                    count++;    //increase count of nums[0][i] \n                }\n            }\n            if(count == numLength){\n                resList.add(nums[0][i]);    //if nums[0][i] count is equals 3 then add to another array\n            }\n            count = 0;\n        }\n        \n        Collections.sort(resList);// sort the result array\n        \n        return resList;\n    }\n}\n```
['Java']