#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MAX = 200010;
const int MOD = 1000000007;

ll fac[MAX], finv[MAX], inv[MAX];

void init(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

ll nCr(int n,int k){
  if(n<k) return 0;
  if(n<0 || k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main(){
  ll a,b,n,k;
  cin>>a>>b>>n>>k;
  a=a%MOD,b=b%MOD;
  
  init();
  
  vector<ll> A(n+2);
  for(int i=1;i<=n+1;i++){
    if(i==1) A[i]=a;
    else if(i==n+1) A[i]=b;
    else A[i]=(nCr(n-1,i-1)*a%MOD+nCr(n-1,i-2)*b%MOD)%MOD;
  }
  
  ll ans=0;
  for(int i=1;i<=n+1;i++) ans=(ans+A[i]*A[i]%MOD)%MOD;
  
  cout<<A[k]<<endl;
  cout<<ans<<endl;

  return 0;
}