def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result
mod=10**9+7
a,b=map(int,input().split())
n,k=map(int,input().split())
def ans(x,y):
  return (a*cmb(x-1,y-1)+b*cmb(x-1,y-2))%mod
print(ans(n,k))
print((a*ans(2*n-1,n)+b*ans(2*n-1,n+1))%mod)