#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back   
#define mp make_pair     
#define nline "\n"           
#define debug(x) cerr<<#x<<" = "<<x<<" "   
#define dnl cerr<<"\n"                       
const ll N=2e12+5;     
const ll M=998244353;  
ll binpow(ll a,ll b){
    if(b==0)
        return 1;
    ll x=binpow(a,b/2);
    x=(x*x)%M;
    if(b%2)
        return (x*a)%M;
    return x;
}  
void solve(){  
    ll n,m; cin>>n>>m;
    vector<ll> dist[m+2];  
    ll fact[n+2];    
    fact[0]=1;  
    for(ll i=1;i<=n;i++)
        fact[i]=(fact[i-1]*i)%M;
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=m;j++){
            ll x; cin>>x;  
            dist[j].pb(x);
        }
    }
    ll conquered=0;
    for(ll i=1;i<=m;i++){
        ll now=1;
        vector<ll> smaller(n+3,0);
        for(ll x:dist[i]){
            for(ll j=1;j<x;j++)
                smaller[j]++;
        }
        ll sub=0;
        for(ll i=n;i>=1;i--){
            ll mul=smaller[i]-sub;
            if(mul<=0)  
                now=0;
            else
                now=(now*mul)%M;
            sub++;
        }
        conquered=((conquered+fact[n]-now)%M+M)%M;
    }
    ll inv=binpow(fact[n],M-2);
    conquered=(conquered*inv)%M;
    cout<<conquered;
}
int main()                               
{         
    ios_base::sync_with_stdio(false);                      
    cin.tie(NULL);                     
    #ifndef ONLINE_JUDGE       
    freopen("input.txt", "r", stdin);                                     
    freopen("output.txt", "w", stdout);  
    freopen("error.txt", "w", stderr);                        
    #endif             
    ll t=1;
    //cin>>t;  
    while(t--){
        solve();  
    }
    cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n"; 
}                                