#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
    long y;
    
    if(n>3)
    {
        y=(pow(k-1,n-3)+(pow(k-1,n-4)*pow(k-2,2)));
        return y;
    }
    else
    {
        if(x==1)
            return k-1;
        else
            return k-2;
    }
    // Return the number of ways to fill in the array.
}

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