#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int read()
{int x=0,f=1;char c=getchar();while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();return x*f;
}
#define N 2010
int n,k,low,high,a[N][N],l[N][N],r[N][N],up[N][N];
int L,R,U,D;
long long s[N][N];
long long sum(int l,int r,int u,int d)
{return s[d][r]-s[d][l-1]-s[u-1][r]+s[u-1][l-1];
}
int main()
{
#ifndef ONLINE_JUDGEfreopen("bzoj1127.in","r",stdin);freopen("bzoj1127.out","w",stdout);const char LL[]="%I64d\n";
#elseconst char LL[]="%lld\n";
#endifk=read(),n=read();low=k,high=k<<1;for (int i=1;i<=n;i++)for (int j=1;j<=n;j++){s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+(a[i][j]=read());if (a[i][j]>=low&&a[i][j]<=high) {cout<<j<<' '<<i<<' '<<j<<' '<<i;return 0;}}for (int i=1;i<=n;i++){for (int j=1;j<=n;j++)if (a[i][j]<low) up[i][j]=up[i-1][j]+1,l[i][j]=l[i][j-1]+1;for (int j=n;j>=1;j--)if (a[i][j]<low) r[i][j]=r[i][j+1]+1;for (int j=1;j<=n;j++)if (up[i][j]>1) l[i][j]=min(l[i][j],l[i-1][j]);for (int j=n;j>=1;j--)if (up[i][j]>1) r[i][j]=min(r[i][j],r[i-1][j]);}for (int i=1;i<=n;i++)for (int j=1;j<=n;j++)if (a[i][j]<low&&sum(j-l[i][j]+1,j+r[i][j]-1,i-up[i][j]+1,i)>=low){L=j-l[i][j]+1,R=j+r[i][j]-1,U=i-up[i][j]+1,D=i;break;}if (!L) cout<<"NIE";else{while (sum(L,R,U,D)>high){if (D>U){if (sum(L,R,U,D-1)<low) U=D;else D--;}else R--;}cout<<L<<' '<<U<<' '<<R<<' '<<D;}return 0;
}