#include<bits/stdc++.h>
#define lf double
#define ll long long
#define ull unsigned ll
#define ii pair<int,int>
#define il pair<int,ll>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define pll pair<ll,ll>
#define ld long int
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000007
#define inf 2000000009
#define N 100005
#define LOG 21
#define K 1005
#define M 105
#define EPS 0.0000001
using namespace std; 

int n,kk,x,dp[N][3],tut[3];

void add(int &r,int val,int mul) {

   r=(r+1ll*val*mul%MOD)%MOD;

}

int main() {

   scanf("%d %d %d",&n,&kk,&x);

   int others=kk-2;

   // 0->1 1->x 2-> ot

   if(x!=1) {

      dp[1][0]=1;

      tut[0]=tut[1]=1;
      tut[2]=others;
   
   }
   else {

      dp[1][1]=1;

      tut[0]=0;
      tut[1]=1;
      tut[2]=others+1;

   }

   for(int i=1;i<n;i++) {

      for(int j=0;j<3;j++) {

         for(int k=0;k<3;k++) {

            if(k==j && k!=2) continue ;

            if(k==2 && j==2) {

               if(tut[k]-1<0) continue ;
              
               add(dp[i+1][k],dp[i][j],tut[k]-1);
               continue ;

            }

            add(dp[i+1][k],dp[i][j],tut[k]);

         }

      }

   }   

   printf("%d",dp[n][1]);

}