#include <bits/stdc++.h>

#define MODULO 1000000007
using namespace std;

long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    int k_temp = k-n+2;
    int n_temp = n-2;
    int small;
    int large;
    if(k_temp > n_temp )
    {
        large = k_temp;
        small = n_temp;
    }
     else
    {
         large= n_temp;
         small= k_temp;
    }
    //cout<<"large: "<<large<<"\n"<<"small: "<<small<<"\n";
    int fact_nume=1;
    int fact_deno=1;
    
    for(int i = k; i >= large+1; i-- )
    {
        fact_nume = (fact_nume % MODULO) * i;
    }
   // cout<<"fact_nume: "<<fact_nume<<"\n";
    for(int i = small; i > 0;i-- )
    {
        fact_deno = (fact_deno % MODULO) * i;
    }
    //cout<<"fact_deno: "<<fact_deno<<"\n";
    long result = fact_nume/fact_deno;
    return result;
    
}

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