#!/bin/python3

import sys
import math

def getPermute(n):
    if(n<0):
        return 0
    if(n==0):
        return 1;
    else:
        return n*getPermute(n-1)
def getMod(n):
    n = n%(math.pow(10,7)+7)
def countArray(n, k, x):
    a = int((getPermute(n-3)*(n-4))/getPermute(n-2-k))
    return getMod(a)

if __name__ == "__main__":
    n, k, x = input().strip().split(' ')
    n, k, x = [int(n), int(k), int(x)]
    answer = countArray(n, k, x)
    print(answer)