#include <fstream>
#include <vector>
using namespace std;
string file = "plantatie";
ifstream cin (file + ".in");
ofstream cout (file + ".out");
const int N = 500;
int dp[9][N+1][N+1], np;

vector <int> p;
inline void putere(int n)
{
    p.push_back(1);
    for (int i=2; i<=n; i=i<<1)
    {
        p.push_back(i);
    }
    np = p.size();
}

inline int cb (int x)
{
    int st = 1, dr = np-1;
    while (st <= dr)
    {
        int mid = (st+dr)/2;
        if (p[mid] <= x)
        {
            st = mid+1;
        }
        else
        {
            dr = mid-1;
        }
    }
    return dr;
}
inline void rmq(int n)
{
    for (int k=1; k<np; k++)
    {
        for (int i=p[k]; i<=n; i++)
        {
            for (int j=p[k]; j<=n; j++)
            {
                dp[k][i][j] = max(max(dp[k-1][i][j],dp[k-1][i-p[k-1]][j]),max(dp[k-1][i][j-p[k-1]],dp[k-1][i-p[k-1]][j-p[k-1]]));
            }
        }
    }
}

inline int interogare(int i, int j, int k)
{
    int e = cb(k), x = p[e];
    return max(max(dp[e][i+x-1][j+x-1],dp[e][i+k-1][j+x-1]),max(dp[e][i+x-1][j+k-1],dp[e][i+k-1][j+k-1]));
}
int main ()
{
    int n, m, x, y, z;
    cin >> n >> m;
    putere(n);
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            cin >> dp[0][i][j];
        }
    }
    rmq(n);
    for (int i=1; i<=m; i++)
    {
        cin >> x >> y >> z;
        cout << interogare(x,y,z) << '\n';
    }
}