#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

mint f(vector<vector<int>> A){
    int N = A.size(), M = A[0].size();
    // N が小さい場合
    if (15 < M){
        vector<mint> dp(1 << N);
        dp[0] = 1;
        rep(j, 0, M){
            vector<mint> n_dp(1 << N);
            rep(k, 0, 1 << N) rep(a, 0, N){
                if (k & (1 << a)) continue;
                if (j == M - 1 || A[a][j + 1] != A[0][0]){
                    n_dp[k + (1 << a)] += dp[k];
                }
                else{
                    n_dp[k] += dp[k];
                }
            }
            swap(n_dp, dp);
        }
        return vec_sum(dp);
    }
    // M が小さい場合
    else{
        vector<mint> dp(1 << M);
        dp[0] = 1;
        rep(i, 0, N){
            vector<mint> X(1 << M), Y(1 << M);
            X[0] = 1;
            Y[0] = 1;
            rep(j, 0, M){
                rep(k, 0, 1 << j) Y[k + (1 << j)] += X[k];
                if (j + 1 == M || A[i][j + 1] != A[0][0]){

                }
                else{
                    rep(k, 0, 1 << j) X[k + (1 << j)] += X[k];
                }
            }
            vector<mint> n_dp(1 << M);
            rep(a, 0, 1 << M){
                for (int b = a; b >= 0; b--){
                    b = (b & a);
                    n_dp[a] += dp[a - b] * Y[b];
                }
            }
            swap(n_dp, dp);
        }
        return dp.back();
    }
}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, M;
    cin >> N >> M;
    vector A(N, vector<int>(M));
    rep(i, 0, N) rep(j, 0, M) cin >> A[i][j];
    So(A);
    mint ans = 0;
    for (int l = 0, r = 0; l < N; l = r){
        vector<vector<int>> B;
        while (r != N && A[l][0] == A[r][0]) B.push_back(A[r]), r++;
        ans += f(B);
    }
    cout << ans.val() << "\n";
}
/*
 * 最初の要素 -> 重複して選んでいい
 * それ以外 -> ダメ
 * 末尾や、選ばなかった場所のカタランチックになる
 * NM 小さいんかーいい
 * 何故か見間違えてた...
 * min(N, M) <= 17 なので指数が間に合う
 *
 */