mod = 10**9 + 7
a, b = map(int, input().split())
n, k = map(int, input().split())
f = [1]
for i in range(n):
    f.append(f[i] * (i + 1) % mod)
inv = [pow(f[i], mod - 2, mod) for i in range(n + 1)]

def ncr(n, r):
    if r < 0 or n < r:
        return 0
    return f[n] * inv[r] * inv[n - r] % mod

print((a * ncr(n - 1, k - 1) + b * ncr(n - 1, k - 2)) % mod)
ans = 0
for i in range(n + 1):
    ans += (a * ncr(n - 1, i) + b * ncr(n - 1, i - 1)) ** 2
    ans %= mod
print(ans)