Very Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int kthLargestValue(int[][] matrix, int k) {\n        List<Integer>list=new ArrayList<>();\n        int m=matrix.length;\n        int n=matrix[0].length;\n        int [][]dt=new int [m][n];\n                                \n        for(int i=0;i<m;i++)\n        {\n            for(int j=0;j<n;j++)\n            {\n                if(i==0  && j==0)\n                {\n                    dt[i][j]=matrix[i][j];\n\n                }\n                else if(i==0)\n                {\n                    dt[i][j]=matrix[i][j]^dt[i][j-1];\n                }\n                else if(j==0)\n                {\n                    dt[i][j]=matrix[i][j]^dt[i-1][j];\n                }\n                else{\n                    dt[i][j]=dt[i-1][j]^dt[i][j-1]^dt[i-1][j-1]^matrix[i][j];\n                }\n                \n                list.add(dt[i][j]);\n            }\n        }\n        return QuickSelect(list,k);     \n    }\n    public int QuickSelect(List<Integer>nums,int k){\n        int pivotIndex=new Random().nextInt(nums.size());\n        int pivot=nums.get(pivotIndex);\n        List<Integer>left=new ArrayList<>();\n        List<Integer>mid=new ArrayList<>();\n        List<Integer>right=new ArrayList<>();\n\n        for(int num:nums){\n            if(num>pivot){\n                left.add(num);\n\n            }\n            else if(num<pivot){\n                right.add(num);\n            }\n            else{\n                mid.add(num);\n            }\n        }\n        if(k<=left.size()){\n            return QuickSelect(left,k);\n        }\n        if(left.size()+mid.size()<k){\n            return QuickSelect(right,k-left.size()-mid.size());\n        }\n        return pivot;\n\n    }\n}\n```
['Java']