#include <iostream>
#include <vector>

template <int MOD>
class ModInt {
    using lint = long long;

private:
    int extgcd(int a, int b, lint& x, lint& y) const {
        if (a < b) return extgcd(b, a, y, x);
        if (b > 0) {
            int g = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
            return g;
        } else {
            x = 1, y = 0;
            return a;
        }
    }

public:
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // assignment
    ModInt& operator=(const ModInt& x) {
        if (this != &x) { this->val = x.val; }
        return *this;
    }

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt operator~() const {
        lint x, y;
        extgcd(this->val, MOD, x, y);
        return ModInt(x);
    }

    // increment / decrement
    ModInt& operator++() { return *this += 1; }
    ModInt& operator--() { return *this -= 1; }
    ModInt operator++(int) {
        ModInt before = *this;
        ++(*this);
        return before;
    }
    ModInt operator--(int) {
        ModInt before = *this;
        --(*this);
        return before;
    }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator%(const ModInt& x) const { return ModInt(*this) %= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt operator^(const ModInt& x) const { return ModInt(*this) ^= x; }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator%=(const ModInt& x) {
        val %= x.val;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= ~x; }
    ModInt& operator^=(const ModInt& x) {
        int n = x.val;
        ModInt b = *this;
        if (n < 0) n = -n, b = ~b;

        *this = 1;
        while (n > 0) {
            if (n & 1) *this *= b;
            n >>= 1;
            b *= b;
        }
        return *this;
    }

    // compare
    bool operator==(const ModInt& b) const { return val == int(b); }
    bool operator!=(const ModInt& b) const { return val != int(b); }
    bool operator<(const ModInt& b) const { return val < int(b); }
    bool operator<=(const ModInt& b) const { return val <= int(b); }
    bool operator>(const ModInt& b) const { return val > int(b); }
    bool operator>=(const ModInt& b) const { return val >= int(b); }

    // I/O
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
};

template <int MOD>
class Combination {
    using mint = ModInt<MOD>;

private:
    int MAX_V;
    std::vector<mint> f, invf;

public:
    explicit Combination(int N)
        : MAX_V(N), f(MAX_V + 1), invf(MAX_V + 1) {
        f[0] = 1;
        for (int i = 1; i <= MAX_V; ++i) {
            f[i] = f[i - 1] * i;
        }

        invf[MAX_V] = ~f[MAX_V];
        for (int i = MAX_V - 1; i >= 0; --i) {
            invf[i] = invf[i + 1] * (i + 1);
        }
    }

    mint fact(int n) const { return f[n]; }
    mint invfact(int n) const { return invf[n]; }
    mint perm(int a, int b) const {
        return a < b ? mint(0) : f[a] * invf[b];
    }
    mint comb(int a, int b) const {
        return a < b ? mint(0) : f[a] * invf[a - b] * invf[b];
    }
};

const int MOD = 1000000007;
using mint = ModInt<MOD>;
const Combination<MOD> C(200010);

int main() {
    int B, W;
    std::cin >> B >> W;

    std::vector<mint> white(B + W, 0), black(B + W, 0);
    // K個食べた時点で白(黒)が残っていない確率

    for (int k = 1; k < B + W; ++k) {
        mint pat = C.comb(k, W) - C.comb(k - 1, W);     // ちょうどk個目で白を食べきるパターン数
        white[k] = white[k - 1] + pat / (mint(2) ^ k);  // 各パターンが起こる確率は1/2^k
        // l<kについてl個未満で白を全部食べる確率はwhite[l]なので、累積和を取っている

        pat = C.comb(k, B) - C.comb(k - 1, B);
        black[k] = black[k - 1] + pat / (mint(2) ^ k);
    }

    for (int k = 0; k < B + W; ++k) {
        // 白が1つもなければ確率は1
        // 白も黒も1つ以上残っていれば確率は1/2
        std::cout << white[k] - (white[k] + black[k] - 1) / 2 << std::endl;
    }
    return 0;
}


Measured memory_bytes: 5376