import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;
enum LIM = 5 * 10^^5;

long[] inv, fac, invFac;
void prepare() {
  inv = new long[LIM];
  fac = new long[LIM];
  invFac = new long[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
    invFac[i] = (invFac[i - 1] * inv[i]) % MO;
  }
}
long binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;
  } else {
    return 0;
  }
}


int A, B;

void main() {
  prepare();
  
  auto invTwo = new long[LIM];
  invTwo[0] = 1;
  foreach (i; 1 .. LIM) {
    invTwo[i] = (invTwo[i - 1] * inv[2]) % MO;
  }
  
  try {
    for (; ; ) {
      A = readInt();
      B = readInt();
      debug {
        writefln("A = %s, B = %s", A, B);
      }
      
      auto ans = new long[A + B];
      
      auto ls = new int[A + B];
      auto rs = new int[A + B];
      foreach (n; 0 .. A + B) {
        ls[n] = max(0, n - (A - 1));
        rs[n] = min(n, B - 1);
      }
      long now;
      foreach (n; 0 .. A + B) {
        if (n == 0) {
          foreach (k; ls[n] .. rs[n] + 1) {
            now += binom(n, k);
          }
        } else {
          now = (now * 2 - binom(n - 1, ls[n - 1]) - binom(n - 1, rs[n - 1])) % MO;
          int l = ls[n - 1] + 1;
          int r = rs[n - 1];
          for (; l < ls[n]; ) {
            now -= binom(n, l++);
            now %= MO;
          }
          for (; l > ls[n]; ) {
            now += binom(n, --l);
            now %= MO;
          }
          for (; r < rs[n]; ) {
            now += binom(n, ++r);
            now %= MO;
          }
          for (; r > rs[n]; ) {
            now -= binom(n, r--);
            now %= MO;
          }
        }
        debug {
          long brt;
          foreach (k; ls[n] .. rs[n] + 1) {
            brt += binom(n, k);
            brt %= MO;
          }
          writeln(n, " ", brt, " ", now);
        }
        ans[n] += now * invTwo[n + 1];
        ans[n] %= MO;
      }
      
      long sum;
      foreach (n; B .. A + B) {
        sum += binom(n - 1, B - 1) * invTwo[n];
        sum %= MO;
        ans[n] += sum;
        ans[n] %= MO;
      }
      
      foreach (n; 0 .. A + B) {
        ans[n] = (ans[n] % MO + MO) % MO;
        writeln(ans[n]);
      }
    }
  } catch (EOFException e) {
  }
}
