module mod_black_or_white
  implicit none
  integer(8), parameter :: md = 1000000007_8
  integer(8) :: f(0:200000), invf(0:200000), invp(0:200000)
contains
  subroutine init(n)
    implicit none
    integer, intent(in) :: n
    integer :: i
    integer(8) :: p
    f = 0_8
    invf = 0_8
    f(0) = 1_8
    p = 1_8
    do i = 1, n
      f(i) = mod(f(i-1)*int(i,8),md)
      p = mod(p*2_8,md)
    end do
    invf(n) = inv(f(n))
    invp(n) = inv(p)
    do i = n, 1, -1
      invf(i-1) = mod(invf(i)*int(i,8),md)
      invp(i-1) = mod(invp(i)*2_8,md)
    end do
    return
  end subroutine init
  integer(8) function perm(n,k)
    implicit none
    integer, intent(in) :: n, k
    perm = 0_8
    if (n.lt.0.or.k.gt.n) return
    perm = mod(f(n)*invf(n-k),md)
    return
  end function perm
  integer(8) function comb(n,k)
    implicit none
    integer, intent(in) :: n, k
    comb = mod(perm(n,k)*invf(k),md)
    return
  end function comb
  function inv(n) result(y)
    implicit none
    integer(8), intent(in) :: n
    integer(8) :: a, b, x, y, t, q
    a = mod(n,md)
    b = md
    x = 0
    y = 1
    do while(b.ne.0_8)
      q = a/b
      t = b
      b = mod(a,b)
      a = t
      t = y
      y = x
      x = t-q*x
    end do
    do while (y.lt.0_8)
      y = y+md
    end do
    y = mod(y,md)
    return
  end function inv
end module mod_black_or_white
program black_or_white
  use mod_black_or_white
  implicit none
  integer :: b, w, i
  integer(8) :: x = 0_8, y = 0_8
  read(*,*) b, w
  call init(b+w)
  do i = 1, b+w
    write(*,'(i0)') mod(mod(md+1_8-x+y,md)*invp(1),md)
    x = mod(x+comb(i-1,b-1)*invp(i),md)
    y = mod(y+comb(i-1,w-1)*invp(i),md)
  end do
  stop
end program black_or_white