#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}


const ll INF = 2e18;
const int INFi = 1e9;
const int N = 2e5 + 50;
const int LG = 20;

template<typename T>
int normalize(T value, int mod) {
    if (value < -mod || value >= 2 * mod) value %= mod;
    if (value < 0) value += mod;
    if (value >= mod) value -= mod;
    return value;
}

template<int mod>
struct static_modular_int {
    using mint = static_modular_int<mod>;

    int value;

    static_modular_int() : value(0) {}
    static_modular_int(const mint &x) : value(x.value) {}

    template<typename T, typename U = std::enable_if_t<std::is_integral<T>::value>>
    static_modular_int(T value) : value(normalize(value, mod)) {}

    template<typename T>
    mint power(T degree) const {
        degree = normalize(degree, mod - 1);
        mint prod = 1, a = *this;
        for (; degree > 0; degree >>= 1, a *= a)
            if (degree & 1)
                prod *= a;

        return prod;
    }

    mint inv() const {
        return power(-1);
    }

    mint& operator=(const mint &x) {
        value = x.value;
        return *this;
    }

    mint& operator+=(const mint &x) {
        value += x.value;
        if (value >= mod) value -= mod;
        return *this;
    }

    mint& operator-=(const mint &x) {
        value -= x.value;
        if (value < 0) value += mod;
        return *this;
    }

    mint& operator*=(const mint &x) {
        value = int64_t(value) * x.value % mod;
        return *this;
    }

    mint& operator/=(const mint &x) {
        return *this *= x.inv();
    }

    friend mint operator+(const mint &x, const mint &y) {
        return mint(x) += y;
    }

    friend mint operator-(const mint &x, const mint &y) {
        return mint(x) -= y;
    }

    friend mint operator*(const mint &x, const mint &y) {
        return mint(x) *= y;
    }

    friend mint operator/(const mint &x, const mint &y) {
        return mint(x) /= y;
    }

    mint& operator++() {
        ++value;
        if (value == mod) value = 0;
        return *this;
    }

    mint& operator--() {
        --value;
        if (value == -1) value = mod - 1;
        return *this;
    }

    mint operator++(int) {
        mint prev = *this;
        value++;
        if (value == mod) value = 0;
        return prev;
    }

    mint operator--(int) {
        mint prev = *this;
        value--;
        if (value == -1) value = mod - 1;
        return prev;
    }

    mint operator-() const {
        return mint(0) - *this;
    }

    bool operator==(const mint &x) const {
        return value == x.value;
    }

    bool operator!=(const mint &x) const {
        return value != x.value;
    }

    bool operator<(const mint &x) const {
        return value < x.value;
    }

    template<typename T>
    explicit operator T() {
        return value;
    }

    friend std::istream& operator>>(std::istream &in, mint &x) {
        std::string s;
        in >> s;
        x = 0;
        for (const auto c : s)
            x = x * 10 + (c - '0');

        return in;
    }

    friend std::ostream& operator<<(std::ostream &out, const mint &x) {
        return out << x.value;
    }

    static int primitive_root() {
        if constexpr (mod == 1'000'000'007) return 5;
        if constexpr (mod == 998'244'353) return 3;
        if constexpr (mod == 786433) return 10;

        static int root = -1;
        if (root != -1)
            return root;

        std::vector<int> primes;
        int value = mod - 1;
        for (int i = 2; i * i <= value; i++)
            if (value % i == 0) {
                primes.push_back(i);
                while (value % i == 0)
                    value /= i;
            }

        if (value != 1) primes.push_back(value);
        for (int r = 2;; r++) {
            bool ok = true;
            for (auto p : primes) {
                if ((mint(r).power((mod - 1) / p)).value == 1) {
                    ok = false;
                    break;
                }
            }
            if (ok) return root = r;
        }
    }
};

// constexpr int MOD = 1'000'000'007;
 constexpr int MOD = 998'244'353;
using mint = static_modular_int<MOD>;


using P = vi;
P operator*(const P &a, const P &b) {
    P c(a.size());
    rep(i, a.size()) c[i] = a[b[i]];
    return c;
}
P inv(const P &a) {
    P res(a.size());
    rep(i, a.size()) res[a[i]] = i;
    return res;
}

struct PermSubgroup {
    vector<P> orbit, S;
};

P reduce(const P &a, const P &b) {
    P c = inv(a) * b;
    c.pop_back();
    return c;
}

#define sz(a) (int)(a.size())

struct PermGroup {  // time complexity: N^5
    int N;
    vector<PermSubgroup> G;
    PermGroup(int _N) : N(_N) {
        G.resize(N);
        rep(i, N) {
            G[i].orbit.resize(i + 1);
            G[i].orbit[i].resize(i + 1);
            iota(all(G[i].orbit[i]), 0);  // identity on i+1 elements
        }
    }
    bool contains(int i, const P &p) {
        if (i == 0) return true;
        if (!sz(G[i].orbit[p[i]])) return false;
        return contains(i - 1, reduce(G[i].orbit[p[i]], p));
    }
    void insert(int i, const P &p) {
        if (contains(i, p)) return;
        G[i].S.pb(p);
        assert(sz(G[i].orbit) == i + 1);
        rep(j, i + 1) if (sz(G[i].orbit[j])) add_to_orbit(i, p * G[i].orbit[j]);
    }
    void add_to_orbit(int i, const P &p) {
        if (sz(G[i].orbit[p[i]])) insert(i - 1, reduce(G[i].orbit[p[i]], p));
        else {
            G[i].orbit[p[i]] = p;
            for (const P &m : G[i].S) add_to_orbit(i, m * p);
        }
    }
};

void solve() {
    int n, m; cin >> n >> m;
    PermGroup g(n);
    rep(_, m) {
        P p(n);
        rep(i, n) cin >> p[i];
        rep(i, n) p[i]--;
        g.insert(n - 1, p);
    }
    vector<vector<mint>> dp(n, vector<mint> (n));
    rep(i, n) {
        for(int j = i + 1; j < n; ++j) {
            dp[i][j] = 1;
        }
    }
    rep(i, n) {
        vector<vector<mint>> dp2(n, vector<mint> (n));
        rep(j, i + 1) {
            if (g.G[i].orbit[j].empty()) continue;
            P p = g.G[i].orbit[j];
            while (p.size() < n) p.push_back(p.size());
//            for(auto x : p) cerr << x << ' ';
//            cerr << '\n';
            rep(x, n) {
                rep(y, n) {
                    if (!dp[x][y]) continue;
                    dp2[p[x]][p[y]] += dp[x][y];
                }
            }
        }
        swap(dp, dp2);
    }
    mint ans = 0;
    rep(i, n) {
        rep(j, i) {
            ans += dp[i][j];
        }
    }
    cout << ans << '\n';
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}