#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <unordered_set>
//#include <unordered_map>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
int n,m;
vvint vv;
vvint ww;
bool foo(int a,int b){
	reep(i,a,a+m){
		reep(j,b,b+m){
			if(ww[i-a][j-b]==-1) continue;
			if(ww[i-a][j-b]!=vv[i][j]) return false;
		}
	}
	return true;
}
void mainmain(){
	while(cin>>n>>m,n||m){
		initvv(vv,n,n);
		initvv(ww,m,m);
		rep(i,n){
			rep(j,n){
				cin>>vv[i][j];
			}
		}
		rep(i,m){
			rep(j,m){
				cin>>ww[i][j];
			}
		}
		vector<pii> ans;
		rep(i,4){
			vvint tmp=ww;
			pii t;
			rep(j,m){
				rep(k,m){
					tmp[j][k]=ww[k][m-1-j];
				}
			}
			ww=tmp;
			bool f=false;
			rep(j,m){
				rep(k,m){
					if(ww[j][k]!=-1){
						// cout<<ww[j][k]<<endl;
						t=pii(j,k);
						f=true;
						break;
					}
				}
				if(f) break;
			}
			// cout<<"t "<<t.F<<" "<<t.S<<endl;
			rep(j,n-m+1){
				rep(k,n-m+1){
					if(foo(j,k)){
						// cout<<"ans "<<j<<" "<<k<<endl;
						ans.PB(pii(j+t.F,k+t.S));
					}
				}
			}
		}
		sort(ALL(ans));
		if(ans.size()==0){
			cout<<"NA"<<endl;
		}
		else{
			cout<<ans[0].S+1<<" "<<ans[0].F+1<<endl;
		}
	}
}



}
main() try{
    mainmain();
}
catch(...){
}