Python easy solution iterative (100% faster)
\nclass Solution:\n    def canFormArray(self, arr: List[int], pieces: List[List[int]]) -> bool:\n        for p in pieces:\n            if p[0] not in arr:\n    
```\nclass Solution:\n    def canFormArray(self, arr: List[int], pieces: List[List[int]]) -> bool:\n        for p in pieces:\n            if p[0] not in arr:\n                return False\n            if len(p) > 1:\n                i = 0\n                j = arr.index(p[i])\n                while True:\n                    if i == len(p):\n                        break\n                    if j == len(arr) or arr[j] != p[i]:\n                        return False\n                    else:\n                        i += 1\n                        arr.remove(arr[j])\n          \n        return True\n```
[]