#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pl;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
	uniform_int_distribution<int> uid(0,lim-1);
	return uid(rang);
}
int mpow(int base, int exp); 
void ipgraph(int n, int m);
void dfs(int u, int par);

const int mod = 998244353 ;

const int N = 1e6;
// const int N = (2e5+10), M = N;
//=======================
const int INF = 1e9;

vi g[N];
int a[N];


ll fac[N], inv[N], b[N];
void pre(){
	int i;
	fac[0] = inv[0] = 1;
	fac[1] = inv[1] = 1;
	Fo(i, 2, N){
		fac[i] = (i*fac[i-1])%mod;
		inv[i] = (mpow(i, mod-2)*inv[i-1])%mod;
	}
}
ll C(int n, int r){
	if (r>n)return 0;
	ll ans = fac[n];
	ans *= inv[r];
	ans %= mod;
	ans *= inv[n-r];
	ans %= mod;
	return ans;
}




void solve() {

  int n,m;
  cin>>n>>m;

  ll d[n][m];
  fo(i,n){
    fo(j,m)cin>>d[i][j];
  }

  ll x = 0;

  fo(i,m){
    vl t;
    fo(j,n){
      t.pb( d[j][i]);

    }
    sortall(t);
    ll temp = 1;
    fo(j,n){
      // if(t[j]-1-j <= 0) temp = 0;
      temp = temp*(t[j] - 1 - j);
      temp%=mod;
    }

    

  

    x+=((fac[n] - temp)%mod);

    // deb2(x, i);
    // deb(temp);
    x%=mod;
  }
  
  x = (x+mod)%mod;
 

  // cout<<x<<endl;
  // deb(fac[n]);

  ll y = inv[n];
   y = (y+mod)%mod;
  // deb(y);
  cout<<((x*y) + mod)%mod;

  // fo(i,10){
  //   deb2(i, inv[i]);
  // }



}

int main() {
  pre();
  #ifndef ONLINE_JUDGE
	freopen("DATA.in", "r", stdin);
	freopen("DATA.out", "w", stdout);
	#endif 
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());

    int t = 1;
    // cin >> t;

    while(t--) {
      solve();
    }

    return 0;
}

int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((ll)result * base) % mod;
    base = ((ll)base * base) % mod;
    exp >>= 1;
  }
  return result;
}

void ipgraph(int n, int m){
	int i, u, v;
	while(m--){
		cin>>u>>v;
    u--, v--;
		g[u].pb(v);
		g[v].pb(u);
	}
}

void dfs(int u, int par){
	for(int v:g[u]){
		if (v == par) continue;
		dfs(v, u);
	}
}