MOD = 10 ** 9 + 7
MAX = 2 * 10 ** 5 + 10
modinv = lambda a, mod=MOD: pow(a, -1, mod)
fac, inv = [1] * MAX, [1] * MAX
for i in range(1, MAX):
    fac[i] = fac[i - 1] * i % MOD
    inv[i] = modinv(fac[i])


def comb(n, k, error=0):
    if not 0 <= k <= n:
        return error
    return fac[n] * inv[k] * inv[n - k] % MOD


def ab_pascal(n, k):
    return (A * comb(n - 1, k - 1) + B * comb(n - 1, k - 2)) % MOD


A, B = map(lambda x: int(x) % MOD, input().split())
N, K = map(int, input().split())

a1 = ab_pascal(N, K)

a2 = 0
for i in range(1, N + 2):
    a2 += ab_pascal(N, i) ** 2
    a2 %= MOD

print(a1)
print(a2)