1
class Solution:
2
    def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
3

4
        row = []
5
        for i in range(len(mat)):
6
            row.append((sum(mat[i]), i))
7

8
        row.sort()
9
        ans = [idx for (val, idx) in row[:k]]
10

11
        return ans