#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");

inline int maxim(int a, int b, int c, int d)
{
    return max(max(max(a,b),c),d);
}

int r[17][502][502], e[502], n, m, k, x, y;

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            cin>>r[0][i][j];

    for(int p=1; (1<<p)<=n; p++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                r[p][i][j] = r[p-1][i][j];
                int i1=i+(1<<(p-1));
                int j1=j+(1<<(p-1));
                if(i1<=n && j1<=n)
                    r[p][i][j] = maxim(r[p][i][j], r[p-1][i1][j], r[p-1][i1][j1], r[p-1][i][j1]);
            }
        }
    }
    e[1]=0;
    for(int i=2; i<=n; i++)
        e[i]=e[i/2]+1;

    for(int q=1; q<=m; q++)
    {
        cin>>x>>y>>k;
        int exp = e[k];
        int len = (1<<exp);
        int i1 = x+k-len;
        int j1 = y+k-len;
        cout<<maxim(r[exp][x][y], r[exp][x][j1], r[exp][i1][y], r[exp][i1][j1])<<endl;
    }
    return 0;
}