#include <bits/stdc++.h>

using namespace std;
long fact(int n)
{
    if(n<1)
        return 1;
    long f=1;
    for(int i=1;i<=n;i++)
        f=f*i;
    return f;
}
long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    long t = fact(k)/(fact(k-n+2));
    
    //cout<<t<<"HI";
    if(x<=k)
    {
        t=t- 2*fact(k-1)/(fact(k-n+2));
        t=t+ fact(k-2)/(fact(k-n+2));
    }
    else
    {
        t=t- fact(k-1)/(fact(k-n+2));
        
    } 
       
    return t;
}

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