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
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
#define int long long
const int mod=1000000007;
//const int mod=1009;
//const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=3e5+5;
int T[2][rozmiar],dl[2],ans[rozmiar*2],podtablice[2][rozmiar],ciag[2][rozmiar];
int znak(int x){
    if(x>0)
        return 1;
    return -1;
}
void oblicz(int start,int nr){
    int zasieg=max(dl[0],dl[1]);
    int other=(nr+1)%2;
    for(int i=2;i<=zasieg;i++){
        int ile=2,used=0;
        int suma=0;
        for(int j=start+2;j<=dl[nr];j++){
            if(znak(T[nr][j]-T[nr][j-1])!=znak(T[nr][j-1]-T[nr][j-2])){
                ile=1;
            }
            ile++;
            if(ile>i){
                used++;
                ile=2;
            }
            if(used)
                suma+=podtablice[other][used-1];
        }
        int dlugosc=dl[nr]-start+1;
        ans[i]+=ciag[other][dlugosc]-suma;
        //cout<<nr<<" "<<start<<" "<<i<<" "<<dlugosc<<" "<<ciag[other][dlugosc]<<" "<<suma<<"\n";
        //ans[i]%=mod;
    }
}
void oblicz_podtablice(int nr){
    int suma=0;
    int other=(nr+1)%2;
    for(int i=1;i<=dl[nr];i++)
    {
        suma+=dl[nr]-i+1;
        podtablice[nr][i]=suma;
        //cout<<nr<<" "<<i<<" "<<suma<<"\n";
    }
    for(int i=dl[nr]+1;i<=dl[other];i++){
        podtablice[nr][i]=suma;
    }
}
void oblicz_ciag(int nr){
    int suma=0;
    int other=(nr+1)%2;
    for(int i=1;i<=dl[nr];i++){
        suma+=podtablice[nr][i];
        ciag[nr][i]=suma;
        //cout<<nr<<" "<<i<<" "<<suma<<"\n";
    }
    for(int i=dl[nr]+1;i<=dl[other];i++){
        suma+=podtablice[nr][i];
        ciag[nr][i]=suma;
    }
}
void solve()
{
    int n,m;
    cin>>n>>m;
    dl[0]=n,dl[1]=m;
    for(int i=0;i<2;i++){
        oblicz_podtablice(i);
        oblicz_ciag(i);
        for(int j=1;j<=dl[i];j++)
            cin>>T[i][j];
    }
    for(int i=0;i<2;i++){
        for(int j=1;j<=dl[i];j++)
            oblicz(j,i);
    }
    //cout<<"siema "<<ans[2]<<"\n";
    for(int i=max(n,m);i>=2;i--){
        ans[i]-=ans[i-1];
    }
    for(int i=1;i<=min(n,m);i++){
        ans[2]-=(n-i+1)*(m-i+1);
    }
    for(int i=1;i<=n+m;i++){
        ans[i]%=mod;
        cout<<ans[i]<<" ";
    }
}
    
int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}