#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
  long long  mod =(int)1e9+7;
 if(n==4 )
 {
     if(k==3)
        return 3;
     if(k==2)
            return 1;
}
  n=n-2;
    if(n-2%2)
        return  (int)(pow(n/2+1,k-1)+pow(n/2,k))%mod;
    else
        return (int)(pow(n/2,k-1)+pow(n/2,k))%mod;
    
}

int main() {
    int n;
    int k;
    int x;
    cin >> n >> k >> x;
    long answer = countArray(n, k, x);
    cout << answer << endl;
    return 0;
}