#include<bits/stdc++.h>

#define ll long long
#define fornum(A,B,C) for(A=B;A<C;A++)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

/////////////////////////////////////////////////////
#define MOD (ll)(1e9+7)

ll B,W;
ll i, j, k;
ll fa[202020];

ll moddiv(ll a,ll b){
    a %= MOD;
    b %= MOD;
    for(ll m=MOD-2;m>0;m/=2){
        if(m&1){
            a=a*b%MOD;
        }
        b=b*b%MOD;
    }
    return a;
}
int main(){
    scanf("%lld%lld", &B, &W);
    fa[0] = 1;
    fornum(i,0,B+W+10){
        fa[i + 1] = fa[i] * (i + 1) % MOD;
    }
    ll an = moddiv(1,2);
    ll aaa = moddiv(1,2);
    fornum(i,1,B+W){
        printf("%lld\n", aaa);
        an = moddiv(an, 2);
        if(B<=i){
            aaa = (aaa + MOD - an*moddiv(fa[i-1], fa[B-1] * fa[i - B])%MOD)%MOD;
            //printf("%lldb", moddiv(fa[i - 1], fa[B-1] * fa[i - B]));
        }
        if(W<=i){
            aaa = (aaa + an * moddiv(fa[i-1], fa[W-1] * fa[i - W])%MOD) % MOD;
            //printf("%lldw", moddiv(fa[i - 1], fa[W-1] * fa[i - W]));
        }
    }
    printf("%lld", aaa);
    return 0;
}