Funny solution with Go
\nfunc intersection(nums [][]int) []int {\n    numSet := make([]int, 1001)\n    \n    for i := 0; i < len(nums); i++ {\n        for j := 0; j < len(nums[i]); j+
```\nfunc intersection(nums [][]int) []int {\n    numSet := make([]int, 1001)\n    \n    for i := 0; i < len(nums); i++ {\n        for j := 0; j < len(nums[i]); j++ {\n            numSet[nums[i][j]]++\n        }\n    }\n    \n    var res []int\n    \n    for i := 0; i < 1001; i++ {\n        if numSet[i] == len(nums) {\n            res = append(res, i)\n        }\n    }\n    \n    sort.Ints(res)\n    \n    return res\n}\n```
['Go']