#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	int n, m;
	while(cin >> n >> m && n)
	{
		vector<vint> view(n, vint(n)), piece(m, vint(m)), buf(m, vint(m));

		rep(y, n) rep(x, n)
			cin >> view[y][x];

		rep(y, m) rep(x, m)
			cin >> piece[y][x];

		complex<int> P(10000, 10000);
		rep(i, 4)
		{	rep(y, n - m + 1)
			{
				rep(x, n - m + 1 )
				{
					rep(sy, m)
					{
						rep(sx, m)
						{
							if(piece[sy][sx] != -1 && view[y + sy][x + sx] != piece[sy][sx]) 
								goto ng;
						}
					}

					rep(sy, m) 
					{	rep(sx, m)
						{
							if(piece[sy][sx] != -1)
							{
								complex<int> p = complex<int>(x + sx + 1, y + sy + 1);
								if(p.imag() < P.imag() || (p.imag() == P.real() && p.real() < P.real()))
									P = p;
								goto ng;
							}
						}
					}
ng:
					;
				}
			}
			
			// rotate
			rep(sy, m / 2) rep(sx, m)
				swap(piece[sy][sx], piece[m - sy - 1][sx]);
			REP(sy, 1, m) rep(sx, sy)
				swap(piece[sy][sx], piece[sx][sy]);
		}

		if(P.real() == 10000)
			cout << "NA" << endl;
		else
			cout << P.real() << " " << P.imag() << endl;
	}
}