#include <bits/stdc++.h>

using namespace std;

const int N = 4e5 + 5, M = 1.7e7 + 5, K = 9;

int n, m, t;
vector<int> a[N], p, q, pm[N];
int f[M];

inline int mp(vector<int> &p)
{
    int s = 0;
    for(int i = n - 1, f = 1; i >= 0; f *= n - i, i -- )
    {
        for(int j = i + 1; j < n; j ++ )
            if(p[j] < p[i])
                s += f;
    }
    return s;
}

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i ++ ) p.push_back(i);
    do pm[mp(p)] = p, t ++ ;
    while(next_permutation(p.begin(), p.end()));
    for(int i = 1; i <= m; i ++ )
    {
        for(int i = 0; i < n; i ++ ) scanf("%d", &p[i]);
        a[i] = p;
        f[mp(p) * n] ++ ;
    }
    for(int i = t - 1; i >= 0; i -- )
    {
        p = pm[i];
        // printf("#%d\n", i);
        // for(int j = 0; j < n; j ++ ) printf("%d ", p[j]);
        // puts("");
        for(int j = 0; j < n - 1; j ++ )
        {
            int t = i * n + j;
            if(!f[t]) continue;
            // printf("*%d\n", j);
            for(int k = j + 1; k < n; k ++ )
                if(p[k] < p[j])
                {
                    q = p;
                    int mx = j;
                    for(int l = j + 1; l <= k; l ++ )
                        if(p[l] < p[mx] && p[l] >= p[k])
                        {
                            mx = l;
                            swap(q[l], q[j]);
                        }
                    // for(int l = 0; l < n; l ++ ) printf("%d ", q[l]);
                    // puts("");
                    f[mp(q) * n + j + 1] += f[t];
                }
            f[t + 1] += f[t];
        }
    }
    for(int i = 1; i <= m; i ++ )
    {
        int t = mp(a[i]);
        printf("%d\n", f[t * n + n - 1]);
    }
    return 0;
}