#include <bits/stdc++.h>

using i64 = long long;

const int P = 1E9 + 7;

const int N = 180;
std::vector<int> A[N];

std::vector<int> work(std::vector<int> a, std::vector<int> b) {
    const int n = a.size();
    std::vector<int> c(n);
    for (int i = 0; i < n; i++) {
        c[i] = a[b[i]];
    }
    return c;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;

    for (int i = 0; i < m; i++) {
        A[i].resize(n);
        for (int j = 0; j < n; j++) {
            std::cin >> A[i][j];
            A[i][j]--;
        }
    }

    if (m <= 14) {
        std::set<std::vector<int>> S;
        for (int i = 1; i < (1 << m); i++) {
            std::vector<int> a;
            for (int j = 0; j < m; j++) {
                if (i >> j & 1) {
                    if (a.empty()) {
                        a = A[j];
                    } else {
                        a = work(a, A[j]);
                    }
                }
            }
            S.insert(a);
        }
        std::cout << S.size() % P << "\n";
    } else {
        std::set<std::vector<int>> S;
        for (int i = 0; i < m; i++) {
            auto t = S;
            for (auto &v : t) {
                S.insert(work(v, A[i]));
            }
            S.insert(A[i]);
        }
        std::cout << S.size() % P << "\n";
    }

    return 0;
}