a,b=map(int,input().split())
n,k=map(int,input().split())
f=[1]
mod=10**9+7
for i in range(n+17):f.append(f[-1]*(i+1)%mod)
def comb(n,r):
  return f[n]*pow(f[n-r],mod-2,mod)*pow(f[r],mod-2,mod)%mod
def ff(n,k):
  ans=0
  if k!=n:
    ans+=a*comb(n-1,k)
  if k!=0:
    ans+=b*comb(n-1,k-1)
  return ans%mod
print(ff(n,k-1))
ans=0
for k in range(n+1):ans=(ans+ff(n,k)**2)%mod
print(ans)