Python 3 (nine lines) (beats 100%)
```\nclass Solution:\n    def reconstructMatrix(self, U: int, L: int, C: List[int]) -> List[List[int]]:\n        M, u = [[0]*len(C) for _ in range(2)], C.count(
```\nclass Solution:\n    def reconstructMatrix(self, U: int, L: int, C: List[int]) -> List[List[int]]:\n        M, u = [[0]*len(C) for _ in range(2)], C.count(2)\n        if U + L != sum(C) or u > min(L,U): return []\n        for j,s in enumerate(C):\n            if s == 2: M[0][j] = M[1][j] = 1\n        for j,s in enumerate(C):\n            if s == 1:\n                if u < U: M[0][j], u = 1, u + 1\n                else: M[1][j] = 1\n        return M\n            \n\t\t\t\n- Junaid Mansuri
['Python', 'Python3']