#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  ll a, b, n, k;
  cin >> a >> b >> n >> k;
  vector<mint> fact(n + 1, 1);
  rep(i, n) fact[i + 1] = fact[i] * (i + 1);
  vector<mint> invfact(n + 1);
  invfact[n] = fact[n].inv();
  for (int i = n; i > 0; --i) invfact[i - 1] = invfact[i] * i;
  auto Combi = [&](int n, int r) {
    return fact[n] * invfact[r] * invfact[n - r];
  };
  mint ans1 = Combi(n - 1, k - 1) * a + Combi(n - 1, n - k + 1) * b;
  mint ans2 = mint(a).pow(2) + mint(b).pow(2);
  for (int i = 1; i < n; ++i) {
    mint num = Combi(n - 1, i - 1) * a + Combi(n - 1, n - 1 - i) * b;
    ans2 += num * num;
  }
  cout << ans1.val() << '\n';
  cout << ans2.val() << '\n';
  return 0;
}