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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template <typename A, typename B>
using unordered_map2 = __gnu_pbds::gp_hash_table<A, B>;
using namespace __gnu_pbds;
template <typename T> using ordered_set =
  __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
                   __gnu_pbds::tree_order_statistics_node_update>;
// ordered_set<int> s; s.insert(1); s.insert(2);
// s.order_of_key(1);    // Out: 0.
// *s.find_by_order(1);  // Out: 2.

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, ll b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

constexpr int nax = 200 * 1000 + 105;

constexpr int kax = 450;
constexpr int iax = 450;
static_assert(iax * kax >= nax);

ll wynik[11];

int n, k;
int tab[2][nax];

int m, ostatni;
int ciag[iax][kax];
int zlicz[iax][kax * 3];
int przes[iax];

#ifdef LOCAL
void Wypisz() {
  for (int i = 0; i < m; i++) {
    cout << "|";
    for (int j = 0; j < kax; j++) {
      cout << " " << (ciag[i][j] + przes[i]);
    }
  }
  cout << " |";
  for (int j = 0; j < ostatni; j++) {
    cout << " " << (ciag[m][j] + przes[m]);
  }
  cout << "\n";
}
#endif

void Dodaj(int i, int od, int z) {
  int najm = numeric_limits<int>::max();
  for (int j = 0; j < kax; j++) {
    ciag[i][j] += przes[i];
    if (j >= od) ciag[i][j] += z;
    Mini(najm, ciag[i][j]);
  }
  debug() << imie(i) imie(m) imie(ostatni);
  debug() << range(ciag[i], ciag[i] + kax);
  fill(zlicz[i], zlicz[i] + 3 * kax, 0);
  przes[i] = najm;
  for (int j = 0; j < kax; j++) {
    ciag[i][j] -= najm;
    assert(0 <= ciag[i][j] and ciag[i][j] < 3 * kax);
    zlicz[i][ciag[i][j]]++;
  }
}

void DodajDoWyniku(int od_y) {
  const int start_i = od_y / kax;
  if (start_i < m) {
    wynik[0] -= od_y % kax;
  }
  for (int i = start_i; i < m; i++) {
    for (int suma = 0; suma < 11; suma++) {
      // v + przes == suma
      // v = suma - przes
      const int v = suma - przes[i];
      if (0 <= v and v < 3 * kax) {
        debug() << imie(i) imie(suma) imie(zlicz[i][v]);
        wynik[suma] += zlicz[i][v];
      }
    }
  }
  for (int j = max(od_y - m * kax, 0); j < ostatni; j++) {
    const int v = ciag[m][j] + przes[m];
    if (0 <= v and v < 11) {
      debug() << imie(j) imie(v);
      wynik[v]++;
    }
  }
}

vector<pair<int, int>> dodawanka[nax];

void Przetworz() {
  debug() << imie(2 * n) imie(kax);
  m = 2 * n / kax;
  ostatni = (2 * n) % kax;
  debug() << imie(m) imie(ostatni);
  assert(kax * m <= 2 * n);
  assert(kax * m + ostatni == 2 * n);
  assert(m + 1 < iax);

  for (int i = 0; i < m; i++) {
    zlicz[i][0] = kax;
    przes[i] = 0;
  }

  for (int x = 2 * n - 1; x >= 0; x--) {
    for (const auto& [y, z] : dodawanka[x]) {
      const int trafiony = y / kax;
      for (int i = trafiony + 1; i <= m; i++) {
        przes[i] += z;
      }
      Dodaj(trafiony, y % kax, z);
    }
    #ifdef LOCAL
    debug() << "Skonczylem(" imie(x) ")";
    Wypisz();
    #endif
    DodajDoWyniku(x);
  }
}

void Krawedz(int a, int b) {
  if (a < b) {
    dodawanka[a].emplace_back(b, -1);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  cin >> n >> k;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < n; j++) {
      cin >> tab[i][j];
      tab[i][j]--;
      assert(0 <= tab[i][j] and tab[i][j] < 2 * n);
    }
  }

  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < n; j++) {
      Krawedz(tab[i][j], tab[i][(j + 1) % n]);
      Krawedz(tab[i][j], tab[i][(((j - 1) % n) + n) % n]);
      Krawedz(tab[i][j], tab[i ^ 1][j]);
    }
  }
  for (int j = 0; j < n; j++) {
    const int nast = (j + 1) % n;
    const int a = min(min(tab[0][j], tab[1][j]), min(tab[0][nast], tab[1][nast]));
    const int b = max(max(tab[0][j], tab[1][j]), max(tab[0][nast], tab[1][nast]));
    dodawanka[a].emplace_back(b, 1);
  }
  for (int i = 0; i < n * 2; i++) {
    dodawanka[i].emplace_back(i, 1);
  }

  Przetworz();

  //wynik[0] -= ((2ll * n) * (2ll * n) - 2ll * n) / 2;
  wynik[1] += wynik[0];

  for (int i = 1; i <= k; i++) {
    if (i > 1) cout << " ";
    cout << wynik[i];
  }
  cout << "\n";
  return 0;
}