#include <iostream>
#include <vector>

class ModInt {
    using lint = long long;

private:
    int val;

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

public:
    static int MOD;

    // constructor
    ModInt() : val(0){};
    ModInt(lint v) {
        this->val = (-MOD < v && v < MOD ? v : v % MOD);
        if (this->val < 0) this->val += MOD;
    }
    ModInt(const ModInt& n) : val(n.val){};

    // cast
    operator int() const { return this->val; }
    operator lint() const { return this->val; }
    operator bool() const { return this->val != 0; }

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

    // unary operator
    ModInt operator+() const { return val; }
    ModInt operator-() const { return MOD - val; }
    ModInt operator~() const {
        int 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;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        int sum = this->val + x.val;
        return *this = (sum < MOD ? sum : sum - MOD);
    }
    ModInt& operator-=(const ModInt& x) {
        int diff = this->val - x.val;
        return *this = (diff >= 0 ? diff : diff + MOD);
    }
    ModInt& operator+=(int x) { return *this += ModInt(x); }
    ModInt& operator-=(int x) { return *this -= ModInt(x); }

    template <class T>
    ModInt& operator*=(const T& x) { return *this = lint(this->val) * lint(x) % MOD; }
    template <class T>
    ModInt& operator/=(const T& x) {
        if (this->val % int(x) == 0) {
            this->val /= int(x);
        } else {
            *this *= ~ModInt(x);
        }
        return *this;
    }
    template <class T>
    ModInt& operator^=(const T& x) {
        int n = int(x);
        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
    template <class T>
    friend bool operator==(const ModInt& a, const T& b) { return a.val == int(b); }
    template <class T>
    friend bool operator!=(const ModInt& a, const T& b) { return a.val != int(b); }
    template <class T>
    friend bool operator<(const ModInt& a, const T& b) { return a.val < int(b); }
    template <class T>
    friend bool operator<=(const ModInt& a, const T& b) { return a.val <= int(b); }
    template <class T>
    friend bool operator>(const ModInt& a, const T& b) { return a.val > int(b); }
    template <class T>
    friend bool operator>=(const ModInt& a, const T& b) { return a.val >= int(b); }

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

// arithmetic
template <class T>
ModInt operator+(const ModInt& a, const T& b) { return ModInt(a) += b; }
template <class T>
ModInt operator-(const ModInt& a, const T& b) { return ModInt(a) -= b; }
template <class T>
ModInt operator*(const ModInt& a, const T& b) { return ModInt(a) *= b; }
template <class T>
ModInt operator/(const ModInt& a, const T& b) { return ModInt(a) /= b; }
template <class T>
ModInt operator^(const ModInt& a, const T& b) { return ModInt(a) ^= b; }

int ModInt::MOD = 1000000007;

class Combination {
private:
    int MAX_V;
    std::vector<ModInt> 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);
        }
    }

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

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

    Combination P(B + W);

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

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

        pat = P.comb(k, B) - P.comb(k - 1, B);
        black[k] = black[k - 1] + pat / (ModInt(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