#include<fstream>
std::ifstream fin("plantatie.in");
std::ofstream fout("plantatie.out");
int n, m;
int rmq[505][505][10];
int lg[505];
inline void precalc()
{
    fin>>n>>m;
    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
            fin>>rmq[i][j][0];

    lg[1]=0;
    for(int i=2; i<505; ++i)
        lg[i]=lg[i/2]+1;

    for(int k=1; (1<<k)<=n; ++k)
        for(int i=1; i<=n-(1<<k)+1; ++i)
            for(int j=1; j<=n-(1<<k)+1; ++j)
            {
                int l=1<<(k-1);
                rmq[i][j][k]=std::max(std::max(std::max(rmq[i][j][k-1], rmq[i+l][j][k-1]), rmq[i][j+l][k-1]), rmq[i+l][j+l][k-1]);
            }
}
inline int query(int i, int j, int k)
{
    int p=lg[k], rem=k-(1<<p);
    return std::max(std::max(std::max(rmq[i][j][p], rmq[i+rem][j][p]), rmq[i][j+rem][p]), rmq[i+rem][j+rem][p]);
}
inline void solve()
{
    for(int i=0; i<m; ++i)
    {
        int index, next, k;
        fin>>index>>next>>k;
        fout<<query(index, next, k)<<'\n';
    }
}
int main()
{
    std::ios_base::sync_with_stdio(false);
    precalc();
    solve();
    return 0;
}