Short JavaScript Solution Using a Set Object
\nconst intersection = nums => {\n    if (nums.length === 1) return nums[0].sort((a, b) => a - b)\n\t\n    let initSet = new Set(nums[0]) //Initial Set \n\n    
```\nconst intersection = nums => {\n    if (nums.length === 1) return nums[0].sort((a, b) => a - b)\n\t\n    let initSet = new Set(nums[0]) //Initial Set \n\n    for (let i = 1; i < nums.length; i++) {\n        initSet = new Set([...nums[i]].filter(x => initSet.has(x)))\n    }\n\t\n    return Array.from(initSet).sort((a, b) => a - b)\n};\n```
['JavaScript']