#include <stdio.h>
#include <ctype.h>
using namespace std;
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
const int N = 500;
int R[10][N+1][N+1],E[N+1];
int main()
{
    InParser fin("plantatie.in");
    OutParser fout("plantatie.out");
     int n , m ;
    fin>>n>>m;
    for(int i = 1;i<=n;i++)
        for(int j = 1;j<=n;j++)
            fin>>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 k = i + (1<<(p-1));
                int q = j + (1<<(p-1));
                if(k<=n&&R[p][i][j]<R[p-1][k][j])
                    R[p][i][j] = R[p-1][k][j];
                if(q<=n&&R[p][i][j]<R[p-1][i][q])
                    R[p][i][j] = R[p-1][i][q];
                if(k<=n&&q<=n&&R[p][i][j]<R[p-1][k][q])
                    R[p][i][j] = R[p-1][k][q];
            }
    }
    for(int i = 2;i<=n;i++)
        E[i] = E[i/2]+1;
    for(int i = 1;i<=m;i++)
    {
        int x, y,s;
        fin>>x>>y>>s;
        int e = E[s];
        int len = (1<<e);
        fout<<max(max(R[e][x][y],R[e][x+s-len][y]),max(R[e][x][y+s-len],R[e][x+s-len][y+s-len]))<<'\n';

    }
    return 0;
}