#include <fstream>
#include <vector>

using namespace std;

ifstream cin("plantatie.in");
ofstream cout("plantatie.out");

const int MAX = 505;

void solve_log(vector < int > &l) {
  for (int i = 2; i <= MAX; i ++) {
    l[i] = l[i / 2] + 1;
  }
}

int main() {
  int n, m;
  cin >> n >> m;

  vector < int > lg2(MAX + 1);
  solve_log(lg2);

  int dp[MAX][MAX][lg2[n] + 2];

  for (int i = 1; i <= n; i ++) {
    for (int j = 1; j <= n; j ++) {
      cin >> dp[i][j][0];
    }
  }

  for (int k = 1; k <= lg2[n]; k ++) {
    for (int i = 1; i <= n - (1 << k) + 1; i ++) {
      for (int j = 1; j <= n - (1 << k) + 1; j ++) {
        int sol = dp[i][j][k - 1];
        sol = max (sol, dp[i + (1 << (k - 1))][j][k - 1]);
        sol = max (sol, dp[i][j + (1 << (k - 1))][k - 1]);
        sol = max (sol, dp[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]);
        
        dp[i][j][k] = sol;
      }
    }
  }

  for (int i = 1; i <= m; i ++) {
    int x, y, k;
    cin >> x >> y >> k;
    int l = lg2[k];

    int sol = dp[x][y][l];
    sol = max (sol, dp[x + k - (1 << l)][y][l]);
    sol = max (sol, dp[x][y + k - (1 << l)][l]);
    sol = max (sol, dp[x + k - (1 << l)][y + k - (1 << l)][l]);

    cout << sol << '\n';
  }  
}