#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint998244353;

int main(){
	int N,M;
	cin >> N >> M;
	vector<vector<int>> A(N,vector<int>(M+1,0));
	for(int i=0;i<N;i++) for(int j=0;j<M;j++) cin >> A[i][j];
	mint ans;
	if(N<=M){
		vector<vector<mint>> dp(M+1,vector<mint>(1<<N));
		int val[301];
		memset(val,0,sizeof(val));
		for(int i=0;i<N;i++) val[A[i][0]]|=1<<i;
		for(int i=1;i<=300;i++) if(val[i]>0) dp[0][val[i]]++;
		for(int i=1;i<=M;i++){
			for(unsigned int j=1;j<1<<N;j++){
				int t=A[countr_zero(j)][0];
				for(int k=0;k<N;k++){
					if(j&(1<<k)){
						if(A[k][i]==t) dp[i][j]+=dp[i-1][j];
						else dp[i][j^(1<<k)]+=dp[i-1][j];
					}
				}
			}
		}
		ans=reduce(dp[M].begin(),dp[M].end()).val();
	}
	else{
		//WIP
		assert(false);
	}
	cout << ans.val() << '\n';
}