1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

template<typename _T> inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template<typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

const int N = 1e5 + 7;
const int K = 11;

int n, k, T[2][N];
pair<int, int> I[2 * N];

int cnt_cc, par[2 * N];

int Find(int x)
{
    if (par[x] == x)
        return x;
    return par[x] = Find(par[x]);
}

void Union(int a, int b)
{
    par[a] = b;
}

LL ans[K];

int main()
{
    _upgrade
    
    cin >> n >> k;
    for (int i = 0; i < 2; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cin >> T[i][j];
            I[T[i][j]] = {i, j};
        }
    }

    int di[] = {1, 0, 0};
    int dj[] = {0, 1, n - 1};

    for (int l = 1; l <= 2 * n; l++)
    {
        cnt_cc = 0;
        for (int r = l; r <= 2 * n; r++)
        {
            cnt_cc++;
            par[r] = r;

            pair<int, int> p = I[r];
            int i = p.first, j = p.second;
            for (int m = 0; m < 3; m++)
            {
                int ui = (i ^ di[m]), uj = j + dj[m];
                if (uj >= n)
                    uj -= n;
                int u = T[ui][uj];
                if (l <= u && u <= r)
                {
                    int pu = Find(u);
                    if (r != pu)
                    {
                        cnt_cc--;
                        Union(pu, r);
                    }
                }
            }

            if (1 <= cnt_cc && cnt_cc <= k)
                ans[cnt_cc]++;
        }
    }

    for (int i = 1; i <= k; i++)
        cout << ans[i] << " ";
    cout << "\n";

    return 0;
}