import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc scanbf(): BiggestFloat = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')

# modPow
# 無いので作る
# なんか畳み込んで上手いことやるやつ
proc modPow(x,b,m:int):int=
  if b==0:
    return 1
  if x == 0:
    return 0
  if b == 1:
    return x
  return (modPow((x^2) mod m, b div 2, m) * x^(b mod 2)) mod m



    
proc solve()=
  var
    n = scan()
    m = scan()
    md = 10^9+7
  for x in 1..m:
    var
      (q,r) = ((n+1).div(x),(n+1).mod(x))
      res = ((modPow(q+1,r,md)*modPow(q,x-r-1,md)).mod(md)*(q-1)).mod(md)
    echo res

solve()