#include <bits/stdc++.h>
#define File(name) freopen(#name".in", "r", stdin); freopen(#name".out", "w", stdout);
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T>
inline T read(){
    T n = 0; int f = 1; char ch = getchar();
    while(!isdigit(ch)){
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(isdigit(ch)){
        n = n * 10 + ch - '0';
        ch = getchar();
    }
    return f * n;
}
template<typename T>
void write(T n){
    if(n < 0) return putchar('-'), write(-n);
    if(n / 10) write(n / 10);
    putchar(n % 10 + '0');
}
void input() {}
template<typename Type, typename... Types>
void input(Type &arg, Types &...args){
    arg = read<Type>();
    input(args...);
}
namespace Main{
    const int N = 10, M = 400005;
    int n, m, f[M][N][N];
    vector<int> a[M];
    unordered_map<ll, int> ord;
    inline ll id(const vector<int> &vec){
        ll res = 0;
        for(int x: vec) res = res * 10 + x;
        return res;
    }
    void init(){
        vector<int> p(n);
        iota(p.begin(), p.end(), 1);
        int cur = 0;
        do ord[id(p)] = cur;
        while(cur++, next_permutation(p.begin(), p.end()));
    }
    void Main(){
        input(n, m);
        init();
        for(int i = 0; i < m; i++){
            a[i].resize(n);
            for(int &x: a[i]) input(x);
            f[ord[id(a[i])]][0][0]++;
        }
        vector<int> p(n);
        for(int i = 0; i < n; i++) p[i] = n - i;
        int cur = 1;
        for(int i = 1; i <= n; i++) cur *= i;
        cur--;
        do{
            for(int i = 0; i < n; i++){
                int mx = 0, sum = f[cur][i][i];
                for(int j = i + 1; j < n; j++){
                    if(p[i] > p[j] && p[j] > mx){
                        mx = p[j];
                        swap(p[i], p[j]);
                        f[ord[id(p)]][i][j] += sum;
                        swap(p[i], p[j]);
                    }
                    sum += f[cur][i][j];
                }
                f[cur][i + 1][i + 1] += sum;
            }
        }while(cur--, prev_permutation(p.begin(), p.end()));
        for(int i = 0; i < m; i++){
            write(f[ord[id(a[i])]][n][n]);
            puts("");
        }
        return;
    }
} // namespace Main
int main(){
#ifdef Liuxizai
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif // Liuxizai
    Main::Main();
    return 0;
}