#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
int a[10][500][500];
int log2[500];
int n,m;
void read()
{
    fscanf(f,"%d %d",&n,&m);
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fscanf(f,"%d ",&a[0][i][j]);
}
void logarithm()
{
    log2[1]=2;
    for(int i=2; i<=n; i++)
        log2[i]=log2[i/2]+1;
}
int maxim(int a, int b)
{
    return a>b ? a:b;
}
void solve()
{
    logarithm();
    for(int k=1; k<=log2[n]; k++)
    {
        for(int i=1; i<=n-(1<<k); i++)
        {
            for(int j=1; j<=n-(1<<k); j++)
            {
                a[k][i][j]=maxim(a[k-1][i][j],
                                 maxim(a[k-1][i][j+{1<<k)],
                                  maxim(a[k-1][i+(1<<k][j], a[k-1][i+(1<<k)][j+(1<<k)])));
            }
        }
    }
}
void write()
{
    for(int l=1; l<=m; l++)
    {
        fscanf(f,"%d %d",&i,&j);
        k=log2[j-i+1];
        fprintf(g,"%d",maxim(a[k][i][j],maxim(a[k][i][j-(1<<k)], maxim(a[k][i-(1<<k][j], a[k][i-(1<<k)][j-(1<<k)]))))
    }
}
int main()
{
    f=fopen("plantatie.in","r");
    g=fopen("plantatie.out","w");
    read();
    solve();
    write();
    fclose(f);
    fclose(g);
    return 0;
}