#include <fstream>
#include <algorithm>
#include <queue>
#define nmax 301
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;
    }
};


InParser cin("matrice2.in");
OutParser cout("matrice2.out");


int a[nmax][nmax], dp[nmax][nmax];
int n, q, sol, x1, x2, y1, y2, i, j, ivecin, jvecin, nrc, nrap, mx;
int dx[4]={-1,0,1,0};
int dy[4]={0,1,0,-1};

inline bool inside(int i, int j)
{
    return (i<=n && i>=1 && j<=n && j>=1);
}

int norm(int val)
{
    return (val<=nrap);
}

bool valid(int xs, int ys, int xf, int yf, int val)
{
    nrap++;
    queue<pair<int,int>> q;
    if(a[xs][ys]<val || a[xf][yf]<val)
        return 0;
    dp[xs][ys]=nrap;
    q.push({xs,ys});
    while(!q.empty())
    {
        i=q.front().first;
        j=q.front().second;
        q.pop();
        for(int k=0; k<4; k++)
        {
            ivecin=i+dx[k];
            jvecin=j+dy[k];
            if(a[ivecin][jvecin]>=val && inside(ivecin,jvecin) && dp[ivecin][jvecin]!=nrap)
            {
                dp[ivecin][jvecin]=nrap;
                q.push({ivecin,jvecin});
            }
        }
    }
    if(dp[xs][ys]==nrap && dp[xf][yf]==nrap)
        return 1;
    return 0;
}


int cautare(int x1, int y1, int x2, int y2)
{
    int st=1, dr=mx;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(valid(x1,y1,x2,y2,mid))
        {
            sol=mid;
            st=mid+1;
        }
        else
            dr=mid-1;
    }
    return sol;
}


int main()
{
    cin>>n>>q;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            cin>>a[i][j], mx=max(mx,a[i][j]);

    while(q--)
    {
        cin>>x1>>y1>>x2>>y2;
        cout<<cautare(x1,y1,x2,y2)<<'\n';
    }
}