#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

class ModInt {
public:
    long long x;
    constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}
    constexpr ModInt& operator+=(const ModInt rhs) {
        x += rhs.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    constexpr ModInt operator+(const ModInt rhs) const {
        return ModInt(*this) += rhs; 
    }
    constexpr ModInt& operator-=(const ModInt& rhs) {
        x -= rhs.x;
        if (x < 0) x += MOD;
        return *this;
    }
    constexpr ModInt operator-(const ModInt rhs) const {
        return ModInt(*this) -= rhs; 
    }
    constexpr ModInt& operator*=(const ModInt& rhs) {
        x = x * rhs.x % MOD;
        return *this;
    }
    constexpr ModInt operator*(const ModInt rhs) const {
        return ModInt(*this) *= rhs; 
    }
    constexpr ModInt& operator/=(const ModInt& rhs) {
        ModInt div = powmod(rhs, MOD - 2);
        (x *= div.x) %= MOD;
        return *this;
    }
    constexpr ModInt operator/(const ModInt rhs) const {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt powmod(ModInt m, long long p) {
        if (p == 0) return ModInt(1);
        ModInt tmp = powmod(m, p / 2);
        if (p & 1) return tmp * tmp * m;
        else return tmp * tmp;
    }
    constexpr ModInt& operator++() {
        x += 1;
        return *this;
    }
    constexpr ModInt operator++(int) {
        ModInt tmp(*this);
        operator++();
        return tmp;
    }
    constexpr ModInt& operator--() {
        x -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) {
        ModInt tmp(*this);
        operator--();
        return tmp;
    }

    friend ostream& operator<<(ostream& os, const ModInt &rhs) {
        os << rhs.x;
        return os;
    }
    friend istream& operator>>(istream& is, ModInt& rhs) {
        is >> rhs.x;
        return is;
    }
};
bool operator==(const ModInt& lhs, const ModInt& rhs) {
    return lhs.x == rhs.x;
}
bool operator!=(const ModInt& lhs, const ModInt& rhs) {
    return !(lhs == rhs);
}
ModInt powmod(ModInt m, long long p) {
    if (p == 0) return ModInt(1);
    ModInt tmp = powmod(m, p / 2);
    if (p & 1) return tmp * tmp * m;
    else return tmp * tmp;
}

using modi = ModInt;

// [ModInt]
// verified at https://atcoder.jp/contests/abc021/submissions/15053490
const int NMAX = 200001;
template < typename T >
class Combination {
public:
    std::vector<T> fac, invfac;
    Combination() {
        fac.resize(NMAX), invfac.resize(NMAX);
        fac[0] = fac[1] = T(1);
        invfac[0] = invfac[1] = T(1);
        for (int i = 2; i <= NMAX; i++) {
            fac[i] = fac[i - 1] * T(i);
            invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);
        }
    }

    // nCr = n! / r!(n-r)!
    T nCr(int n, int r) {
        if (n < 0 || r > n || r < 0) return T(0);
        return fac[n] * invfac[r] * invfac[n - r];
    }
    
    // 重複組み合わせ nHr = (n + r - 1)C(r - 1)
    T nHr(int n, int r) {
        return nCr(n + r - 1, r);
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int b, w; cin >> b >> w;
    // i 回目で
    //   i) (B, i-B) にいる確率を p_i
    //  ii) (i-W, W) にいる確率を q_i
    // iii) それ以外にいる確率は 1 - p_i - q_i
    // 次に黒を選ぶ確率は 0*p+i + 1*q_i + (1 - p_i - q_i)*1/2 = (1-p_i+q_i)/2
    Combination<modi> comb;
    V<modi> p(b + w + 1, modi(0)), q(b + w + 1, modi(0));
    for (int i = 1; i <= b + w; i++) {
        p[i] = p[i - 1] + comb.nCr(i - 1, b - 1) / powmod(modi(2), i);
        q[i] = q[i - 1] + comb.nCr(i - 1, w - 1) / powmod(modi(2), i);
    }
    modi div2 = powmod(2, MOD - 2);
    for (int i = 0; i < b + w; i++) cout << (modi(1) - p[i] + q[i]) * div2 << '\n';
    return 0;
}


Measured memory_bytes: 9412