Ralph And His Magic Field

Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic field doesn’t always work properly. It works only if the product of integers in each row and each column equals to k, where k is either 1 or -1.

Now Ralph wants you to figure out the number of ways to put numbers in each block in such a way that the magic field works properly. Two ways are considered different if and only if there exists at least one block where the numbers in the first way and in the second way are different. You are asked to output the answer modulo 1000000007 = 109 + 7.

Note that there is no range of the numbers to put in the blocks, but we can prove that the answer is not infinity.

Input
The only line contains three integers n, m and k (1 ≤ n, m ≤ 1018, k is either 1 or -1).

Output
Print a single number denoting the answer modulo 1000000007.

Examples
input
1 1 -1
output
1
input
1 3 1
output
1
input
3 3 -1
output
16
Note
In the first example the only way is to put -1 into the only block.

In the second example the only way is to put 1 into every block.

题目的大意是向格子里面填数字，保证最后每列每行的乘积都等于k（k为1或者-1）由于填的数字只能是整数，所以填的数字也只能是1或者是-1.可以这样想每次填的数字最后一行（列）是可以根据前面填的进行变化的从而保证这一行（列）符合要求。所以在m-1和n-1中的格子里是可以随便填的（2^((m-1)*(n-1))种。但是经过画图发现当k=-1且m+n为奇数的时候是没有不可能的。
代码如下：

#include
using namespace std;
const long long mod=1e9+7;
long long pow(long long a,long long b)
{
    long long ans=1,vis=a;
    while(b!=0)
    {
        if(b&1)
            ans=(ans%mod)*(vis%mod)%mod;
        vis=(vis%mod)*(vis%mod);
        b>>=1;
    }
    return ans;
}

int main()
{
    long long n,m,k,ans;
    cin>>n>>m>>k;
    if(k==1)
    {
        ans=pow(2,m-1);
        ans=pow(ans,n-1);
        cout<else
    {
        if((m+n)%2==1)
            cout<<0;
        else
        {
            ans=pow(2,m-1);
            ans=pow(ans,n-1);
            cout<return 0;
}