Rust Solution using Prefix Sum
Complexity\n- Time complexity:\nO(n * m)\n\n- Space complexity:\nO(n * m)\n\n# Code\nrust []\nimpl Solution {\n  pub fn kth_largest_value(matrix: Vec<Vec<i32>>,
# Complexity\n- Time complexity:\n$$O(n * m)$$\n\n- Space complexity:\n$$O(n * m)$$\n\n# Code\n```rust []\nimpl Solution {\n  pub fn kth_largest_value(matrix: Vec<Vec<i32>>, k: i32) -> i32 {\n    let n = matrix.len();\n    let m = matrix[0].len();\n    let k = k as usize - 1;\n\n    let mut arr = vec![vec![0;m+1];n+1];\n    for i in 0..n {\n      for j in 0..m {\n        arr[i+1][j+1] = matrix[i][j] ^ arr[i+1][j] ^ arr[i][j+1] ^ arr[i][j];\n      }\n    }\n\n    let mut memo = vec![];\n    for i in 1..=n {\n      for j in 1..=m {\n        memo.push(arr[i][j]);\n      }\n    }\n\n    memo.sort();\n    memo.reverse();\n    memo[k]\n  }\n}\n```
['Prefix Sum', 'Rust']