#include <cstdio>
#include <algorithm>
#define Dim 502

using namespace std;
int n, m, dp[Dim][Dim][10], x, y, Log[Dim], Sol;
void read()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++ i)
        for(int j = 1; j <= n; ++ j)
            scanf("%d", &dp[i][j][0]);
}
int Max(int x, int y)
{
    if(x > y)
        return x;
    return y;
}
void solve()
{
    int i, j, k;
    for(i = 2; i <= n; ++ i)
        Log[i] = Log[i / 2] + 1;

    for(k = 1; (1 << k) <= n; ++ k)
        for(i = 1; i + (1 << (k)) - 1 <= n; ++ i)
            for(j = 1; j + (1 << (k)) - 1 <= n; ++ j)
                dp[i][j][k] = Max(Max(dp[i][j][k - 1], dp[i][j + (1 << (k - 1))][k - 1]),
                                  Max(dp[i + (1 << (k - 1))][j][k - 1], dp[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]));

}
void write()
{
    int k, p;
    while(m --)
    {
        scanf("%d %d %d", &x, &y, &k);
        p = Log[k];
        Sol = Max(Max(dp[x][y][p], dp[x][y + k - (1 << p)][p]),
                  Max(dp[x + k - (1 << p)][y][p], dp[x + k - (1 << p)][y + k - (1 << p)][p]));
        printf("%d\n", Sol);
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}