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
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

#ifdef LOCAL
ostream &operator<<(ostream &out, string str)
{
    for (char c : str)
        out << c;
    return out;
}
template <class L, class R>
ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.first << ", " << p.second << ")"; }
template <class L, class R, class S>
ostream &operator<<(ostream &out, tuple<L, R, S> p)
{
    auto &[a, b, c] = p;
    return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T>
auto operator<<(ostream &out, T a) -> decltype(a.begin(), out)
{
    out << '{';
    for (auto it = a.begin(); it != a.end(); it = next(it))
        out << (it != a.begin() ? ", " : "") << *it;
    return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts>
void dump(T a, Ts... x)
{
    cerr << a << ", ";
    dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int bits(int t)
{
    int cnt = 0;
    while (t)
    {
        if (t & 1)
            cnt++;
        t /= 2;
    }
    return cnt;
}

main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int Z = 1;
    // cin >> Z;
    while (Z--)
    {
        int n, m;
        cin >> n >> m;
        vi V(n), U(m);
        for (auto &a : V)
            cin >> a;
        for (auto &a : U)
            cin >> a;
        vi ANS(m + n, 0);
        vector<vi> LOOK(23);
        int temp = (1 << 22);
        for (int i = 0; i < temp; i++)
        {
            LOOK[bits(i)].push_back(i);
        }
        for (int i = 0; i < n; i++)
            for (int j = i; j < n; j++)
                for (int k = 0; k < m; k++)
                    for (int l = k; l < m; l++)
                    {
                        int siz = (j - i + 1) + (l - k + 1);
                        temp = (1 << siz);
                        int worst = siz;
                        for (auto a : LOOK[j - i + 1])
                        {
                            if (a >= temp)
                                break;
                            int it1 = i, it2 = k;
                            vi T;
                            for (int w = 0; w < siz; w++)
                            {
                                if (a & 1)
                                    T.push_back(V[it1++]);
                                else
                                    T.push_back(U[it2++]);
                                a /= 2;
                            }
                            pii cur{1, 0};
                            int best = 1;
                            for (int w = 1; w < T.size(); w++)
                            {
                                if (T[w] > T[w - 1] && cur.second > 0)
                                    cur.first++;
                                else if (T[w] < T[w - 1] && cur.second < 0)
                                    cur.first++;
                                else
                                {
                                    best = max(best, cur.first);
                                    cur = {2, int(T[w] > T[w - 1]) * 2 - 1};
                                }
                            }
                            best = max(best, cur.first);
                            worst = min(worst, best);
                            // debug(T, best, cur);
                        }
                        ANS[worst - 1]++;
                    }
        for (auto &a : ANS)
            cout << a << ' ';
        cout << endl;
    }
}