#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

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

template<typename T>
struct Combination {
    vector<T> fac, ifac;
    
    Combination(int N = 0) : fac(1, 1), ifac(1, 1) {
        make_table(N);
    }
    
    void make_table(int N) {
        if ((int)fac.size() > N) return;
        int now = fac.size();
        N = max(N, now * 2);
        fac.resize(N + 1);
        ifac.resize(N + 1);
        for (int i = now; i <= N; ++i) fac[i] = fac[i - 1] * i;
        ifac[N] = 1 / fac[N];
        for (int i = N - 1; i >= now; --i) ifac[i] = ifac[i + 1]*(i + 1);
    }
    
    T factorial(int n) {
        make_table(n);
        return fac[n];
    }
    
    T invfac(int n) {
        make_table(n);
        return ifac[n];
    }
    
    T P(int n, int k) {
        if (k < 0 || n < k) return 0;
        make_table(n);
        return fac[n] * ifac[n - k];
    }
    
    T C(int n, int k) {
        if (k < 0 || n < k) return 0;
        make_table(n);
        return fac[n] * ifac[n - k] * ifac[k];
    }
    
    T H(int n, int k) {
        if (n == 0 && k == 0) return 1;
        if (n <= 0 || k < 0) return 0;
        return C(n + k - 1, k);
    }
};

Combination<mint> comb;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    ll a, b, n, k;
    cin >> a >> b >> n >> k;
    
    mint ans1 = 0;
    ans1 = comb.C(n - 1, k - 1) * a + comb.C(n - 1, n - k + 1) * b;
    cout << ans1.val() << '\n';
    
    mint ans2 = 0;
    rep(t, 0, n + 1) {
        mint v = comb.C(n - 1, t) * a + comb.C(n - 1, n - t) * b;
        ans2 += v*v;
    }
    cout << ans2.val() << '\n';
}