a,b = map(int,input().split())
n,k = map(int,input().split())
MOD = 10**9+7
A = [1]*(n+1)
for i in range(1,n+1):
    A[i] = (A[i-1]*i)%MOD
B = [1]*(n+1)
B[n] = pow(A[n],MOD-2,MOD)
for i in range(n-1,0,-1):
    B[i] = (B[i+1]*(i+1))%MOD
def comb(s,t):
    if t<0 or t>s:
        return 0
    if t==0 or t==s:
        return 1
    return (A[s]*B[t]*B[s-t])%MOD
ans = a*comb(n-1,k-1)+b*comb(n-1,n+1-k)
print(ans%MOD)
cnt = 0
for j in range(1,n+2):
    cnt = (cnt+(comb(n-1,j-1)*a+comb(n-1,n+1-j)*b)**2)%MOD
print(cnt)