#include <fstream>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
int dp[20][505][505], lg[505];
int main(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= n; j ++){
            cin >> dp[0][i][j];
        }
    }
    for(int i = 2; i <= n; i ++){
        lg[i] = lg[i / 2] + 1;
    }
    for(int i = 1; i <= lg[n]; i ++){
        for(int j = 1; j <= n - (1 << i) + 1; j ++){
            for(int k = 1; k <= n - (1 << i) + 1; k ++){
                dp[i][j][k] = max(max(dp[i - 1][j][k], dp[i - 1][j + (1 << (i - 1))][k + (1 << (i - 1))]),
                                  max(dp[i - 1][j + (1 << (i - 1))][k], dp[i - 1][j][k + (1 << (i - 1))]));
            }
        }
    }
    int a, b, c;
    for(int i = 1; i <= m; i ++){
        cin >> a >> b >> c;
        int log = lg[c];
        int x = a + c - 1;
        int y = b + c - 1;
        cout << max(max(dp[log][a][b], dp[log][x - (1 << log) + 1][y - (1 << log) + 1]),
                    max(dp[log][x - (1 << log) + 1][b], dp[log][a][y - (1 << log) + 1])) << "\n";
    }
}