#include <bits/stdc++.h>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
const int NMAX = 500;
long long rmq[13][NMAX + 5][NMAX + 5], lg[NMAX + 5];

void solve_rmq(int n)
{
    lg[1] = 0;
    for(int i = 2; i <= n; ++i)
        lg[i] = lg[i>>1] + 1;

    for(int i = 1; (1 << i) <= n; ++i)
    {
        for(int j = 1; j + (1 << i) - 1 <= n; ++j)
        {
            for(int l = 1; l + (1 << i) - 1 <= n; ++l)
            {
                long long a = max(rmq[i-1][j][l], rmq[i-1][j][l + (1 << (i-1))]);
                long long b = max(rmq[i-1][j + (1 << (i-1))][l], rmq[i-1][j + (1 << (i-1))][l + (1 << (i-1))]);
                rmq[i][j][l] = max(a, b);
            }

        }

    }
}

int main()
{
    int n, m, x, y, k;
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            fin >> rmq[0][i][j];
        }
    }
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y >> k;
        long long l = lg[k];
        long long s = k - (1 << l);
        long long maxa = max(rmq[l][x][y], rmq[l][x][y + s]);
        long long maxb = max(rmq[l][x + s][y], rmq[l][x + s][y + s]);
        fout << max(maxa, maxb) << "\n";
    }
    return 0;
}