#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int a[505][505];
int r[10][505][505];
int logaritm[10];

int main()
{
    ifstream fin("plantatie.in");
    ofstream fout("plantatie.out");

    int n, m;
    fin >> n >> m;

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            fin >> a[i][j];
            r[0][i][j] = a[i][j];
        }
    }

    logaritm[1] = 0;
    for(int i = 2; i <= n; i++){
        logaritm[i] = 1 + logaritm[i/2];
    }

    int p = 1;
    while((1 << p) <= n){
        int lat = 1 << (p - 1);
        for(int i = lat; i < n; i++){
            for(int j = lat; j < n; j++){
                r[p][i][j] = max(max(r[p - 1][i - lat][j - lat], r[p - 1][i - lat][j]), max(r[p - 1][i][j - lat], r[p - 1][i][j]));
            }
        }
        p++;
    }

    for(int i = 0; i < m; i++){
        int l, c, k;
        fin >> l >> c >> k;
        l--;
        c--;
        int p = logaritm[k];
        int lat2 = 1 << p;
        int rez = max(max(r[p][l + lat2 - 1][c + lat2 - 1], r[p][l + lat2 - 1][c + k - 1]), max(r[p][l + k - 1][c + lat2 - 1], r[p][l + k - 1][c + k - 1]));
        fout << rez << "\n";
    }

    fin.close();
    fout.close();
    return 0;
}