cpp
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 {\npublic:\n    int kthLargestValue(vector<vector<int>>& matrix, int k) {\n        int m = matrix.size();\n        int n = matrix[0].size();\n        \n        priority_queue<int, vector<int>, greater<int>> pq;\n        \n        // Store the XOR values of each coordinate\n        vector<vector<int>> xorMatrix(m, vector<int>(n, 0));\n        \n        for (int i = 0; i < m; ++i) {\n            for (int j = 0; j < n; ++j) {\n                xorMatrix[i][j] = matrix[i][j];\n                if (i > 0) xorMatrix[i][j] ^= xorMatrix[i - 1][j];\n                if (j > 0) xorMatrix[i][j] ^= xorMatrix[i][j - 1];\n                if (i > 0 && j > 0) xorMatrix[i][j] ^= xorMatrix[i - 1][j - 1];\n                \n                pq.push(xorMatrix[i][j]);\n                if (pq.size() > k) pq.pop();\n            }\n        }\n        \n        return pq.top();\n    }\n};\n```
['C++']