//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

	using i8 = std::int_least8_t;
	using i32 = std::int_least32_t;
	using i64 = std::int_least64_t;
	using u8 = std::uint_least8_t;
	using u32 = std::uint_least32_t;
	using u64 = std::uint_least64_t;
	using isize = std::ptrdiff_t;
	using usize = std::size_t;

	class rep {
		const usize f, l;

	public:
		class itr {
			friend rep;
			usize i;
			constexpr itr(const usize x) noexcept : i(x) {}

		public:
			void operator++() noexcept { ++i; }
			constexpr usize operator*() const noexcept { return i; }
			constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
		};
		constexpr rep(const usize first, const usize last) noexcept
			: f(first), l(last) {}
		constexpr itr begin() const noexcept { return itr(f); }
		constexpr itr end() const noexcept { return itr(l); }
	};
	class revrep {
		const usize f, l;

	public:
		class itr {
			friend revrep;
			usize i;
			constexpr itr(usize x) noexcept : i(x) {}

		public:
			void operator++() noexcept { --i; }
			constexpr usize operator*() const noexcept { return i; }
			constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
		};
		constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
		constexpr itr begin() const noexcept { return itr(l); }
		constexpr itr end() const noexcept { return itr(f); }
	};
	template <class T> using vec_alias = std::vector<T>;
	template <class T> auto md_vec(const usize n, const T &value) {
		return std::vector<T>(n, value);
	}
	template <class... Args> auto md_vec(const usize n, Args... args) {
		return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
	}
	template <class T> constexpr T difference(const T &a, const T &b) {
		return a < b ? b - a : a - b;
	}

} // namespace n91

#include <cassert>
#include <cstdint>

namespace n91 {

template <std::uint_fast64_t Modulus> class modint {
	using u64 = std::uint_fast64_t;

	u64 a;

public:
	constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
	constexpr u64 value() const noexcept { return a; }
	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;
	}
	modint &operator+=(const modint rhs) noexcept {
		a += rhs.a;
		if (a >= Modulus) {
			a -= Modulus;
		}
		return *this;
	}
	modint &operator-=(const modint rhs) noexcept {
		if (a < rhs.a) {
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	modint &operator*=(const modint rhs) noexcept {
		a = a * rhs.a % Modulus;
		return *this;
	}
	modint &operator/=(modint rhs) noexcept {
		u64 exp = Modulus - 2;
		while (exp) {
			if (exp % 2) {
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
		return *this;
	}
};
} // namespace n91


#include <algorithm>
#include <iostream>
#include <utility>
#include<string>
#include<numeric>

namespace n91 {

	void main_() {
		using mint = modint<1000000007>;
		//using mint = double;
		usize b, w;
		std::cin >> b >> w;
		usize n = b + w;
		std::vector<mint> fact(n + 1), inv(n + 1);
		fact[0] = 1;
		for (const auto i : rep(1, n+1)) {
			fact[i] = fact[i - 1] * i;
		}
		inv[n] = mint(1) / fact[n];
		for (const auto i : revrep(1, n + 1)) {
			inv[i - 1] = inv[i] * i;
		}
		const auto comb = [&fact, &inv](const usize n, const usize r) {
			return fact[n] * inv[r] * inv[n - r];
		};
		const mint div2 = mint(1) / mint(2);
		std::vector<mint> all(n);// i 回までで使い切る
		mint acc = 1;
		for (const auto i : rep(0, n)) {
			if (i < w) {
				all[i] = 0;
			}
			else {
				all[i] = acc*comb(i - 1, w - 1);
			}
			acc *= div2;
			if (i != 0) {
				all[i] += all[i - 1];
			}
		}

		//assume b<w

		acc = div2;
		usize pl = 0, pr = 0;
		mint cur = 1;
		std::vector<mint> bot(n);
		bot[0] = 1;
		bot[n - 1] = 0;
		for (const auto i : rep(1, n - 1)) {
			usize l = b - 1, r = i - (w - 1);
			if (i < b) {
				l = i;
			}
			if (i < w) {
				r = 0;
			}
			if (r < l) {
				std::swap(l, r);
			}
			cur *= 2;
			if (pl == l) {
				if (pl != 0) {
					cur += comb(i - 1, pl - 1);
				}
			}
			else {
				cur -= comb(i - 1, pl);
			}
			if (pr + 1 == r) {
				if (pr != i - 1) {
					cur += comb(i - 1, pr + 1);
				}
			}
			else {
				cur -= comb(i - 1, pr);
			}

			bot[i] = cur*acc;

			acc *= div2;

			pl = l;
			pr = r;
		}
		for (const auto i : rep(1, n + 1)) {
			std::cout << (all[i - 1] + bot[i - 1] * div2).value() << std::endl;;
		}
	}

} // namespace n91

int main() {
	n91::main_();
	return 0;
}


Measured memory_bytes: 8448