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
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
namespace debug { template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> char spk(...); template <class c> auto spk(c* a) -> decltype(cerr << *a, 0); struct stream { ~stream() { cerr << endl; } template <class c> typename enable_if <sizeof spk<c>(0) != 1, stream&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if <sizeof spk<c>(0) == 1, stream&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class a, class b> stream& operator<<(pair <a,b> p) { return *this << "(" << p.first << ", " << p.second << ")"; } template <class c> stream& operator<<(rge<c> d) { *this << "["; for (auto it=d.b; it!=d.e; it++) *this << ", " + 2 * (it == d.b) << *it; return *this << "]"; } stream& _dbg(const string& s, int i, int b) { return *this; } template <class c, class ... cs> stream& _dbg(const string& s, int i, int b, c arg, cs ... args) { if (i == (int)(s.size())) return (*this << ": " << arg); b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{') - (s[i] == ')') - (s[i] == ']') - (s[i] == '}'); return (s[i] == ',' && b == 0) ? (*this << ": " << arg << "     ")._dbg(s, i + 1, b, args...) : (s[i] == ' ' ? *this : *this << s[i])._dbg(s, i + 1, b, arg, args...); } };}
#define dout debug::stream()
#define dbg(...) ((dout << ">> ")._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__))
#define f first
#define s second
#define sc scanf
#define pr printf
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define ss(x) ((int)((x).size()))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(b);i>=(a);i--)
#define upgrade cin.tie(0)->sync_with_stdio(0);
#define lowb(v,x) (lower_bound(all(v),(x))-v.begin())
#define uppb(v,x) (upper_bound(all(v),(x))-v.begin())
#define erase_duplicates(x) {sort(all(x));x.resize(unique(all(x))-x.begin());}
template <class p, class q> pair<p,q> operator-(pair<p,q> a, pair<p,q> b) { return mp(a.f - b.f, a.s - b.s); }
template <class p, class q> pair<p,q> operator+(pair<p,q> a, pair<p,q> b) { return mp(a.f + b.f, a.s + b.s); }
template <class p, class q> void umin(p &a, const q &b) { if (a > b) a = b; }
template <class p, class q> void umax(p &a, const q &b) { if (a < b) a = b; }
using lf=long double;
using ll=long long;
using cll=const ll;
using cint=const int;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //

struct node
{
	int min;
	int cnt[11];
	
	node()
	{
		min = 0;
		rep(i, 0, 10) cnt[i] = 0;
		cnt[0] = 1;
	}
};

static inline node merge(const node& a, const node& b)
{
	node c;
	c.min = min(a.min, b.min);
	c.cnt[0] = 0;
	rep(i, 0, 10 - a.min + c.min) c.cnt[i + a.min - c.min] += a.cnt[i];
	rep(i, 0, 10 - b.min + c.min) c.cnt[i + b.min - c.min] += b.cnt[i];
	return c;
}

const int inf = 1e9 + 5;
const int N = 100005;
const int M = (1 << 18);
int t[2][N];
int lazy[M + M];
node tree[M + M];
ll out[11];

static inline void propagate(cint& u)
{
	if (lazy[u] == 0) return;
	tree[u].min += lazy[u];
	if (u < M){
		lazy[u + u + 0] += lazy[u];
		lazy[u + u + 1] += lazy[u];
	}
	lazy[u] = 0;
}

void update(cint& da, cint& db, cint& val, cint& u = 1, cint& na = 0, cint& nb = M)
{
	propagate(u);
	if (na >= db || nb <= da) return;
	if (na >= da && nb <= db){
		lazy[u] += val;
		propagate(u);
		return;
	}
	cint m = (na + nb) / 2;
	update(da, db, val, u + u + 0, na, m);
	update(da, db, val, u + u + 1, m, nb);
	tree[u] = merge(tree[u + u + 0], tree[u + u + 1]);
}

void contribute()
{
	propagate(1);
	node u;
	u.cnt[0] = 0;
	u = merge(u, tree[1]);
	assert(u.min == 0);
	u.cnt[1] += u.cnt[0];
	rep(i, 1, 10) out[i] += u.cnt[i];
}

int main()
{
	int n, k;
	
	scanf("%d%d", &n, &k);

	rep(j, 0, 1) rep(i, 1, n) scanf("%d", &t[j][i]);

	vector < pair < pair <int,int> , int > > events;

	rep(i, 1, n){
		int a = t[0][i];
		int b = t[1][i];
		int c = t[0][i == n ? 1 : i + 1];
		int d = t[1][i == n ? 1 : i + 1];
		events.pb({{max(a, b), min(a, b)}, -1});
		events.pb({{max(a, c), min(a, c)}, -1});
		events.pb({{max(b, d), min(b, d)}, -1});
		events.pb({{max({a, b, c, d}), min({a, b, c, d})}, +1});
	}

	update(0, M, inf);
	
	rep(i, 1, n + n){
		events.pb({{i, i}, -inf + 1});
		events.pb({{i, i - 1}, +inf});
	}

	sort(all(events));

	int pre = 1;
	
	for (auto event : events){
		int x = event.f.f;
		int y = event.f.s;
		int upd = event.s;
		if (pre < x) contribute();
		pre = x;
		update(0, y + 1, upd);
	}

	contribute();

	rep(i, 1, k) printf("%lld ", out[i]);

	printf("\n");

	return 0;
}