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
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#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 VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

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

const int MXN = 1000000;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;
const int TWO_INV= 500000004;

int n, m;
int a[MXN], b[MXN];
int res[MXN];

VI transform(VI &vecA) {
	VI res;
	res.PB(2);
	if(SIZE(vecA) == 2)
		return res;
	FOR(i, 2, SIZE(vecA) - 1) {
		if(vecA[i - 2] < vecA[i - 1] && vecA[i - 1] < vecA[i])
			res[SIZE(res) - 1]++;
		else if(vecA[i - 2] > vecA[i - 1] && vecA[i - 1] > vecA[i])
			res[SIZE(res) - 1]++;
		else {
			res.PB(2);
		}
	}
	return res;
}

bool check(VI vecA, int lenB, int k) {
	if(SIZE(vecA) == 1)
		return k <= 2;

	int cnt = lenB;
	vecA = transform(vecA);

	while(SIZE(vecA) ) {
		if(vecA.back() <= k)
			vecA.pop_back();
		else {
			vecA[SIZE(vecA) - 1] -= (k - 1);
			cnt--;
		}
	}

	return cnt >= 0;
}

map<pair<PII, int>, int> mA;
map<pair<PII, int>, int> mB;

int calc(int ap, int ak, int bp, int bk) {
	int sizeA = ak - ap + 1;
	int sizeB = bk - bp + 1;

	if(sizeA >= sizeB) {
		auto it = mA.find(MP(MP(ap, ak), sizeB));
		if(it != mA.end())
			return it -> S;
	}
	else if(sizeA < sizeB) {
		auto it = mB.find(MP(MP(bp, bk), sizeA));
		if(it != mB.end())
			return it -> S;
	}

	VI vecA, vecB;
	FOR(i, ap, ak)
		vecA.PB(a[i]);
	FOR(i, bp, bk)
		vecB.PB(b[i]);
	if(SIZE(vecA) < SIZE(vecB))
		swap(vecA, vecB);
	
	int res = SIZE(vecA) + SIZE(vecB);
	int L = 2, R = res;
	while(L <= R) {
		int S = (L + R) / 2;
		if(check(vecA, SIZE(vecB), S)) {
			R = S - 1;
			res = min(res, S);
		}
		else
			L = S + 1;
	}

	if(sizeA >= sizeB)
		mA[MP(MP(ap, ak), sizeB)] = res;
	else
		mB[MP(MP(bp, bk), sizeA)] = res;
	return res;
}

void test() {
    scanf("%d %d", &n, &m);
	FOR(i, 1, n)
		scanf("%d", &a[i]);
	FOR(i, 1, m)
		scanf("%d", &b[i]);

	FOR(i, 1, n) {
		FOR(koni, i, n) {
			FOR(j, 1, m)
				FOR(konj, j, m)
					res[calc(i, koni, j, konj)]++;
		}
		FOR(j, 1, n + m)
			res[j] %= MOD; 
	}
	FOR(i, 1, n + m)
		printf("%d ", res[i]);
	printf("\n");
}

int main() {
	int te = 1;
//	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}