#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #endif
}
// the basic idea is to unsort as you can 
// since they will sorted afterwards anyway
// then i simulate the process and see if our matrix a is converted to b
// idea from kostia2488 and ksun's submission
signed main(){
  setIO() ;
  int n,m; rd(n,m);
	vt<vt<int>> a(n,vt<int> (m)),b(n,vt<int> (m));
	rd(a); rd(b);
	vt<int> can_column(m,0); // if this value is zero we can unsort it.
	f(j,0,m){
		for(int i = 0; i+1<n; i++){
			if(b[i][j] > b[i+1][j]){
				can_column[j]++;
			}
		}
	}
	vt<int> ans;
	vt<bool> done_column(m,false), made_cut(n-1,false);// cut[i] = true denoted cut is made at i|i+1
	queue<int> q; // has list of to be sorted columns
	f(j,0,m){
		if(can_column[j] == 0){
			q.push(j);
			ans.pb(j);
			done_column[j] = true ;
		}
	}
	while(sz(q)){
		int j = q.front(); q.pop();
		for(int i = 0; i+1 < n; i++){
			if(made_cut[i]) continue ;
			assert(b[i][j] <= b[i+1][j]);
			if(b[i][j] < b[i+1][j]){
				made_cut[i] = true ;
				for(int j2 = 0; j2 < m; j2++){
					if(done_column[j2]) continue ;
					if(b[i][j2] > b[i+1][j2]){
						can_column[j2]--;
						if(can_column[j2] == 0){
							q.push(j2);
							ans.pb(j2);
							done_column[j2] = true ;
						}
					}
				}
			}
		}
	}
	reverse(all(ans)) ;
	// just simulate the process and check the matrix A and B are equal or not
	
	vt<int> v(n);
	f(i,0,n) v[i] = i ;
	for(auto j : ans){
		vt<int> V, help[n+1];
		for(auto i : v){
			V.pb(a[i][j]);
			help[a[i][j]].pb(i);
		}	
		f(i,1,n+1) reverse(all(help[i])) ;
		sort(all(V));
		f(i,0,n){
			v[i] = help[V[i]].back() ;
			help[V[i]].pop_back();
		}	
	}
	f(i,0,n){
		if(a[v[i]] != b[i]){
			cout << "-1"; exit(0);
		}
	}
	cout << sz(ans) << endl ;
	for(auto i : ans) cout << i + 1 << " " ;
}

