#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr char newl = '\n';

// https://noshi91.hatenablog.com/entry/2019/03/31/174006
template <std::uint_fast64_t Modulus>
struct ModInt {
    using u64 = std::uint_fast64_t;

    static constexpr u64 MOD = Modulus;

    u64 val;

    constexpr ModInt(const u64 x = 0) noexcept : val(x % MOD) {}

    constexpr ModInt operator+() const noexcept { return ModInt(*this); }
    constexpr ModInt operator-() const noexcept {
        ModInt res(*this);
        if (res.val != 0) res.val = MOD - res.val;
        return res;
    }

    // prefix increment/decrement
    constexpr ModInt& operator++() noexcept { return *this += ModInt(1); }
    constexpr ModInt& operator--() noexcept { return *this -= ModInt(1); }

    // postfix increment/decrement
    constexpr ModInt& operator++(int) noexcept {
        ModInt tmp(*this);
        ++*this;
        return tmp;
    }
    constexpr ModInt& operator--(int) noexcept {
        ModInt tmp(*this);
        --*this;
        return tmp;
    }

    constexpr ModInt operator+(const ModInt& rhs) const noexcept {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt& rhs) const noexcept {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt& rhs) const noexcept {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt& rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }

    constexpr ModInt& operator+=(const ModInt& rhs) noexcept {
        val += rhs.val;
        if (val >= Modulus) val -= MOD;
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt& rhs) noexcept {
        if (val < rhs.val) val += MOD;
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt& rhs) noexcept {
        val = val * rhs.val % MOD;
        return *this;
    }

    // prime Modulus only
    constexpr ModInt& operator/=(const ModInt& rhs) noexcept {
        return *this *= rhs.inv();
    }

    // prime Modulus only
    constexpr ModInt inv() const noexcept {
        return pow(*this, MOD - 2);
    }
};

template<std::uint_fast64_t Modulus>
constexpr ModInt<Modulus> pow(ModInt<Modulus> x, std::uint_fast64_t n) {
    ModInt<Modulus> res(1);
    while (n) {
        if (n & 1) res *= x;
        x *= x;
        n >>= 1;
    }
    return res;
}

template<std::uint_fast64_t Modulus>
istream& operator>>(istream& is, ModInt<Modulus>& x) {
    std::uint_fast64_t val;
    is >> val;
    x = ModInt<Modulus>(val);
    return is;
}

template<std::uint_fast64_t Modulus>
ostream& operator<<(ostream& os, const ModInt<Modulus>& x) {
    return os << x.val;
}

using mint = ModInt<1000000007>;

// g++ -Wl,--stack,[STACK SIZE] [file] でスタックサイズを増やすか、
// グローバル変数として宣言して使うこと！！！
template<size_t MAXV, class T = mint>
struct Comb {
    array<T, MAXV + 1> fact, fact_inv;

    constexpr Comb() {
        fact[0] = 1;
        for (size_t i = 1; i <= MAXV; i++) {
            fact[i] = fact[i - 1] * i;
        }

        fact_inv[MAXV] = fact[MAXV].inv();
        for (size_t i = MAXV; i > 0; i--) {
            fact_inv[i - 1] = fact_inv[i] * i;
        }
    }

    constexpr T operator()(int n, int k) {
        if (n < k || n < 0 || k < 0) return 0;
        return fact[n] * fact_inv[k] * fact_inv[n - k];
    }
};

Comb<200000> comb;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int B, W;
    cin >> B >> W;
 
    mint sumb = 0, sumw = 0;
    constexpr mint div2 = mint(2).inv();
    for (int i = 0; i < B + W; i++) {
        mint vb = 0;
        if (i >= B) vb = comb(i - 1, B - 1) * pow(div2, i);
        sumb = (sumb + vb);
 
        mint vw = 0;
        if (i >= W) vw = comb(i - 1, W - 1) * pow(div2, i);
        sumw = (sumw + vw);
 
        mint rest = -sumb - sumw + 1;
        cout << (sumw + rest * div2) << newl;
    }
 
    return 0;
}


Measured memory_bytes: 5376