#include <iostream>
#include <cmath>
using namespace std;
const long long prime = 1000000007;

long long myPow(int x, int n)
{
    long long out=1;
    for(int i = 0; i < n; i++)
    {
        out=(out*x)%prime;
    }
    return out;

}

int main()
{
    long long a,b,k,c, out = 0;
    cin>>a>>b>>k>>c;
    if(a==c || b==c)
    {
        out = (myPow(2, k-1)*k)%prime;
    }
    cout<<out<<endl;

    return 0;
}