#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
    if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
    if(x > y) x = y;
}

inline int popcnt(int x){
    return __builtin_popcount(x);
}

inline int ctz(int x){
    return __builtin_ctz(x);
}

template <int P>
class mod_int
{
    using Z = mod_int;

private:
    static int mo(int x) { return x < 0 ? x + P : x; }

public:
    int x;
    int val() const { return x; }
    mod_int() : x(0) {}
    template <class T>
    mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
    bool operator==(const Z &rhs) const { return x == rhs.x; }
    bool operator!=(const Z &rhs) const { return x != rhs.x; }
    Z operator-() const { return Z(x ? P - x : 0); }
    Z pow(long long k) const
    {
        Z res = 1, t = *this;
        while (k)
        {
            if (k & 1)
                res *= t;
            if (k >>= 1)
                t *= t;
        }
        return res;
    }
    Z &operator++()
    {
        x < P - 1 ? ++x : x = 0;
        return *this;
    }
    Z &operator--()
    {
        x ? --x : x = P - 1;
        return *this;
    }
    Z operator++(int)
    {
        Z ret = x;
        x < P - 1 ? ++x : x = 0;
        return ret;
    }
    Z operator--(int)
    {
        Z ret = x;
        x ? --x : x = P - 1;
        return ret;
    }
    Z inv() const { return pow(P - 2); }
    Z &operator+=(const Z &rhs)
    {
        (x += rhs.x) >= P && (x -= P);
        return *this;
    }
    Z &operator-=(const Z &rhs)
    {
        (x -= rhs.x) < 0 && (x += P);
        return *this;
    }
    Z operator-()
    {
        return -x;
    }
    Z &operator*=(const Z &rhs)
    {
        x = 1ULL * x * rhs.x % P;
        return *this;
    }
    Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                  \
    friend T operator o(const Z &lhs, const Z &rhs) \
    {                                               \
        Z res = lhs;                                \
        return res o## = rhs;                       \
    }
    setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
    
    friend istream& operator>>(istream& is, mod_int& x)
    {
        long long tmp;
        is >> tmp;
        x = tmp;
        return is;
    }
    friend ostream& operator<<(ostream& os, const mod_int& x)
    {
        os << x.val();
        return os;
    }
};

using Z = mod_int<mod>;
Z power(Z p,ll k){
    Z ans = 1;
    while(k){
        if(k % 2 == 1) ans *= p;
        p *= p;
        k /= 2;
    }
    return ans;
}
int n,m;
int a[3005],b[3005];
Z ans[3005];

int eval(int *f,int l,int r,int k){
    int ret = 0;
    for(int pl = l,pr;pl < r;pl = pr){
        pr = pl + 1;
        while(pr < r && (f[pr + 1] - f[pr]) * (f[pr] - f[pr - 1]) > 0) pr++;
        ret += (pr - pl - 1) / k;
    }
    return ret;    
}
Z ssum[2][3005][3005];
int main(){
//    freopen("test.in","r",stdin);
    scanf("%d%d",&n,&m);
    rep(i,1,n) scanf("%d",&a[i]);
    rep(i,1,m) scanf("%d",&b[i]);
    if(max(n,m) > 3000) return 0;
    int sum,cur;
    rep(k,1,n + m - 1){
        rep(i,1,n) fill(ssum[0][i],ssum[0][i] + n + 1,0);
        memset(ssum[1],0,sizeof(ssum[1]));
        rep(l,1,n){
            sum = 0;
            cur = -1;
            ssum[0][1][0] += 1;
            rep(r,l + 1,n){
                if(r > l + 1 && (a[r] - a[r - 1]) * (a[r - 1] - a[r - 2]) < 0){
                    sum += cur / k;
                    cur = 0;
                }else{
                    cur++;
                }
                ssum[0][r - l + 1][sum + cur / k] += 1;
            }
        }
        rep(l,1,m){
            sum = 0;
            cur = -1;
            ssum[1][1][0] += 1;
            rep(r,l + 1,m){
                if(r > l + 1 && (b[r] - b[r - 1]) * (b[r - 1] - b[r - 2]) < 0){
                    sum += cur / k;
                    cur = 0;
                }else{
                    cur++;
                }
                ssum[1][r - l + 1][sum + cur / k] += 1;
            }         
        }
        per(i,m,0){
            rep(j,0,max(n,m)) ssum[1][i][j] += ssum[1][i + 1][j];
        }
        rep(i,0,m){
            rep(j,1,max(n,m)) ssum[1][i][j] += ssum[1][i][j - 1];
        }

        rep(i,1,n){
            rep(j,0,n){
                ans[k + 1] += ssum[0][i][j] * ssum[1][j][i];
            }
        }
//        printf("%d ",ans[k + 1].val());
    }
//    printf("\n");
    per(i,n + m,1) ans[i] -= ans[i - 1];
    rep(i,1,n + m) printf("%d ",ans[i].val());
	return 0;
}