1
class Solution:
2
    def diagonalSort(self, A: List[List[int]]) -> List[List[int]]:
3
        n, m, d = len(A), len(A[0]), defaultdict(list)
4
        any(d[i - j].append(A[i][j]) for i in range(n) for j in range(m))
5
        any(d[sum_].sort(reverse=1) for sum_ in d)
6
        return [[d[i - j].pop() for j in range(m)] for i in range(n)]