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
//
#ifndef __SIZEOF_INT128__
#define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < k; ++i)
#define per(i, p, k) for(int i(p); i > k; --i)
#define sz(x) (int)x.size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fir first
#define sec second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string name): name(name) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cout << #x << " = " << x << '\n';
constexpr int MAXN = 1e5 + 3, MAX2N = MAXN*2;
bool zaz[2][MAXN];
bool py[MAX2N];
int px[MAX2N];
ll odp[MAXN];
int n;
inline int P(int x){
    return x ? x-1 : n-1;
}
inline int N(int x){
    return x==n-1 ? 0 : x+1;
}
std::int32_t main()
{
    int k, x, l; bool y;
    scanf("%d %d", &n, &k);
    rep(i, 0, 2)rep(j, 0, n){
        scanf(" %d", &x);
        px[x] = j;
        py[x] = i;
    }
    rep(p, 1, 2*n+1){
        l = 0;
        rep(k, p, 2*n+1){
            x = px[k];
            y = py[k];
            zaz[y][x] = 1;
            if(!zaz[!y][x])l += 1 - zaz[y][P(x)] - zaz[y][N(x)];
            else if(!zaz[!y][P(x)] || !zaz[!y][N(x)])
                l += min(0, int(zaz[!y][P(x)]||zaz[!y][N(x)]) - (zaz[y][P(x)]||zaz[!y][P(x)]) - (zaz[y][N(x)]||zaz[!y][N(x)]));
            if(l<1)++l;
            ++odp[l];
        }
        rep(i, p, MAX2N)zaz[py[i]][px[i]] = 0;
    }
    rep(i, 1, k+1)printf("%d ", odp[i]);
    printf("\n");
    return 0;
}