#include <cstdio>

using namespace std;
int n, m, i, j, x, y, o, p, l, lg[505], a[505][505], b[505][505][10];
inline int min2(int x, int y)
{
    if(x>y) return y;
    return x;
}
inline int min3(int a, int b)
{
    if(a>b) return a;
    return b;
}
inline int min(int a, int b, int c, int d)
{
    if(a>=b&&a>=c&&a>=d) return a;
    if(b>=a&&b>=c&&b>=d) return b;
    if(c>=a&&c>=b&&c>=d) return c;
    return d;
}
int main()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            scanf("%d", &a[i][j]);
    x=1;
    for(i=1;i<=n;i++)
        if((1<<p)>i) lg[i]=p-1;
        else
        {
            ++p;
            lg[i]=p-1;
        }
    for(i=n;i>=1;i--)
        for(j=n;j>=1;j--)
        {
            b[i][j][0]=a[i][j];
            for(o=1;o<=lg[n+1-min3(i,j)];o++)
                b[i][j][o]=min(b[i][j][o-1], b[i+(1<<(o-1))][j][o-1], b[i][j+(1<<(o-1))][o-1], b[i+(1<<(o-1))][j+(1<<(o-1))][o-1]);
        }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d", &x, &y, &l);
        printf("%d\n", min(b[x][y][lg[l]], b[x][y+l-(1<<(lg[l]))][lg[l]], b[x+l-(1<<(lg[l]))][y][lg[l]], b[x+l-(1<<(lg[l]))][y+l-(1<<(lg[l]))][lg[l]]));
    }
    return 0;
}