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
103
104
105
106
107
108
109
110
111
112
113
114
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<unordered_map>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

class UnionFind {
    private:
        unordered_map<int, int> id, rank, setSize;
        int i_size = 0;

    public:
        UnionFind() {}
        ~UnionFind() {
            id.clear();
            rank.clear();
            setSize.clear();
        }

        int findSet(int i) {
            return (id[i] == i) ? i : (id[i] = findSet(id[i]));
        }
        
        bool connected(int i, int j) {
            return findSet(i) == findSet(j);
        }

        int size() {
            return i_size;
        }

        int sizeOfSet(int i) {
            return setSize[findSet(i)];
        }

        void makeUnion(int i, int j) {
            if (connected(i, j)) return;
            int x = findSet(i), y = findSet(j);
            if (rank[x] > rank[y]) swap(x, y);
            id[x] = y;
            if (rank[x] == rank[y]) ++rank[y];
            setSize[y] += setSize[x];
            --i_size;
        }

        bool contains(int i) {
            return id.find(i) != id.end();
        }

        void add(int i) {
            rank[i] = 0;
            id[i] = i;
            i_size++;
        }
};

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n, k;
    cin >> n >> k;
    vector<VI> canvas(2, VI(n));
    VPII positions(2 * n + 1);
    REP(i, n) {
        cin >> canvas[0][i];
        positions[canvas[0][i]] = { 0, i };
    }
    REP(i, n) {
        cin >> canvas[1][i];
        positions[canvas[1][i]] = { 1, i };
    }
    VI result(k);
    FOR(i, 1, 2 * n) {
        result[0]++;
        UnionFind uf;
        uf.add(i);
        FOR(j, i + 1, 2 * n) {
            uf.add(j);
            int left = canvas[positions[j].ST][(n + positions[j].ND - 1) % n];
            int right = canvas[positions[j].ST][(positions[j].ND + 1) % n];
            int vert = canvas[(positions[j].ST + 1) % 2][positions[j].ND];
            if (uf.contains(left)) uf.makeUnion(j, left);
            if (uf.contains(right)) uf.makeUnion(j, right);
            if (uf.contains(vert)) uf.makeUnion(j, vert);
            if (uf.size() <= k) result[uf.size() - 1]++;
        }
    }
    for (auto x : result) cout << x << ' ';
    cout << '\n';
    return 0;
}