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
/*
 * Opis: Główny nagłówek
 */
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define st first
#define nd second
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif


vector<int> get_res(vector<int> &tab) {
	int n = ssize(tab);
	vector<int> kub(n+1);
	int curr = 2;
	FOR(i, 2, n-1) {
		if ((tab[i-2] > tab[i-1]) != (tab[i-1] > tab[i])) {
			if (curr > 2) {
				kub[curr]++;
			}
			curr = 1;
		}
		curr++;
	}
	if (curr > 2) {
		kub[curr]++;
	}

	priority_queue<array<int, 3> > order;
	FOR(i, 1, n) {
		REP(j, kub[i]) {
			order.push({i, i, 1});
		}
	}
	vector<int> res;
	if (order.empty()) {
		res.resize(n, 2);
		return res;
	}
	REP(i, n) {
		array<int, 3> x = order.top();
		order.pop();
		x[0] = (x[1] + 2*x[2]) / (x[2] + 1);
		x[2]++;
		order.push(x);
		res.push_back(order.top()[0]);
	}
	return res;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	vector<int> p1(n), p2(m);
	REP(i, n) {
		cin >> p1[i];
	}
	REP(i, m) {
		cin >> p2[i];
	}

	vector<int> res(n + m + 1);
	FOR(i, 0, n-1) {
		vector<int> curr;
		FOR(j, i, n-1) {
			curr.push_back(p1[j]);
			vector<int> vals = get_res(curr);
			REP(k, ssize(vals)) {
				// debug(i, j, k+1, m-k, vals[k]);
				res[vals[k]] += max(0, m - k);
			}
		}
	}
	FOR(i, 0, m-1) {
		vector<int> curr;
		FOR(j, i, m-1) {
			curr.push_back(p2[j]);
			vector<int> vals = get_res(curr);
			REP(k, ssize(vals)-1) {
				// debug(i, j, k+1, n-k, vals[k]);
				res[vals[k]] += max(0, n - k);
			}
		}
	}
	FOR(i, 1, n+m) {
		cout << res[i] << " ";
	}
	cout << "\n";
}