using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;
using static System.Console;
using static System.Math;
class Z { static void Main() => new K(); }
class K
{
	int F => int.Parse(Str);
	long FL => long.Parse(Str);
	int[] G => Strs.Select(int.Parse).ToArray();
	uint[] GU => Strs.Select(uint.Parse).ToArray();
	decimal[] GD => Strs.Select(decimal.Parse).ToArray();
	long[] GL => Strs.Select(long.Parse).ToArray();
	string Str => ReadLine();
	string[] Strs => Str.Split(new char[] { ' ', '\t' }, StringSplitOptions.RemoveEmptyEntries);
	static T[] ConstantArray<T>(int n, T val) { var a = new T[n]; for (var i = 0; i < n; i++) a[i] = val; return a; }
	static T[] MakeArray<T>(int n, Func<int, T> f) { var a = new T[n]; for (var i = 0; i < n; i++) a[i] = f(i); return a; }
	static T[] Recursion<T>(int n, T v, Func<int, T, T> f) { var a = new T[n]; a[0] = v; for (var i = 1; i < n; i++) a[i] = f(i, a[i - 1]); return a; }
	static ulong One(int k) => 1ul << k;
	static ulong All(int k) => One(k) - 1;
	static bool Has(ulong s, int k) => (s & One(k)) != 0;
	const int MOD = 1000000007;
	public K()
	{
		SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
		Solve();
		Out.Flush();
	}
	static readonly ModInt Z = ModInt.Two.Inverse;
	ModInt[] f;
	void Solve()
	{
		var I = G;
		int B = I[0], W = I[1];
		f = Recursion(B + W + 1, ModInt.One, (i, x) => i * x);
		var p = Hoge(B, W);
		var q = Hoge(W, B);
		for (var i = 1; i <= B + W; i++)
		{
			var ans = ModInt.One;
			if (i >= W + 1) ans += p[i - W - 1];
			if (i >= B + 1) ans -= q[i - B - 1];
			WriteLine(ans / 2);
		}
	}
	public ModInt[] Hoge(int B, int W) => Recursion(B + 1, Z ^ W, (b, x) => (x + Binom(b + W - 1, b) * (Z ^ (b + W))));
	public ModInt Binom(int a, int b) => f[a] / f[b] / f[a - b];
	public static long Inverse(long a, long mod = MOD)
	{
		if (a < 0) { a %= mod; if (a < 0) a += mod; }
		var t = SolveLinear(a, mod);
		return t.Item1 > 0 ? t.Item1 : t.Item1 + mod;
	}
	public static Tuple<long, long> SolveLinear(long n, long m)
	{
		if (n < 0) { var p = SolveLinear(-n, m); return p == null ? p : new Tuple<long, long>(-p.Item1, p.Item2); }
		if (m < 0) { var p = SolveLinear(n, -m); return p == null ? p : new Tuple<long, long>(p.Item1, -p.Item2); }
		if (n < m) { var p = SolveLinear(m, n); return p == null ? p : new Tuple<long, long>(p.Item2, p.Item1); }
		long a = 1, b = 0, c = 0, d = 1;
		while (m > 0)
		{
			var r = n % m;
			var q = n / m;
			n = m;
			m = r;
			var tmp = a;
			a = -a * q + b;
			b = tmp;
			tmp = c;
			c = -c * q + d;
			d = tmp;
		}
		return n != 1 ? null : new Tuple<long, long>(d, b);
	}
}
struct ModInt : IEquatable<ModInt>
{
	public static readonly ModInt Zero = 0;
	public static readonly ModInt One = 1;
	public static readonly ModInt Two = 2;
	const int MOD = 1000000007;
	public readonly int Val;
	public ModInt(long x) { Val = (int)(x % MOD); }
	public ModInt Inverse => new ModInt(K.Inverse(Val));
	public static ModInt operator +(ModInt a) => new ModInt(a.Val);
	public static ModInt operator -(ModInt a) => new ModInt(MOD - a.Val);
	public static ModInt operator +(ModInt a, ModInt b) => new ModInt(a.Val + b.Val);
	public static ModInt operator -(ModInt a, ModInt b) => new ModInt(a.Val - b.Val + MOD);
	public static ModInt operator *(ModInt a, ModInt b) => new ModInt((long)a.Val * b.Val);
	public static ModInt operator /(ModInt a, ModInt b) => a * b.Inverse;
	public static ModInt operator ^(ModInt a, long b)
	{
		var p = ModInt.One;
		var x = a;
		while (b > 0)
		{
			if ((b & 1) == 1) p *= x;
			b >>= 1;
			x *= x;
		}
		return p;
	}
	public static implicit operator ModInt(long x) => new ModInt(x);
	public static explicit operator int(ModInt x) => x.Val;
	public override string ToString() => Val.ToString();
	public override int GetHashCode() => Val.GetHashCode();
	public override bool Equals(object obj) => Val == ((ModInt)obj).Val;
	public bool Equals(ModInt other) => Val == other.Val;
}

Measured memory_bytes: 18728