[Python] Simple Iteration O(n*m)
\nclass Solution:\n    def kthLargestValue(self, matrix: List[List[int]], k: int) -> int:\n        \n        m=len(matrix)\n        n=len(matrix[0])\n        \n
```\nclass Solution:\n    def kthLargestValue(self, matrix: List[List[int]], k: int) -> int:\n        \n        m=len(matrix)\n        n=len(matrix[0])\n        \n        c=[matrix[0][0]]\n\t\t\n        for i in range(m):\n            for j in range(n):\n\t\t\t\n                if i==0 and j>0:\n                    matrix[i][j]=matrix[i][j]^matrix[i][j-1]\n                    c.append(matrix[i][j])\n\t\t\t\t\t\n                if j==0 and i>0:\n                    matrix[i][j]=matrix[i][j]^matrix[i-1][j]\n                    c.append(matrix[i][j])\n\t\t\t\t\t\n                if i>0 and j>0:\n                    matrix[i][j]=matrix[i-1][j-1]^matrix[i-1][j]^matrix[i][j-1]^matrix[i][j]\n                    c.append(matrix[i][j])\n\n        c= sorted(c)[::-1]\n        \n        return c[k-1]\n        \n```
['Python']