import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long countArray(int n, int k, int x) {
        // Return the number of ways to fill in the array.
        int i,j;
        long count=0;
        int[] a=new int[n];
        a[0]=1;
        a[n-1]=x;
        for(i=1;i<n-1;i++)
        {
            for(j=1;j<=k;j++)
            {
                a[i]=j;
                if(j!=a[i-1]&&j!=a[i+1])
                    count++;
            }
        }
        return count;
        
         
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int x = in.nextInt();
        long answer = countArray(n, k, x);
        System.out.println(answer);
        in.close();
    }
}