import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
1 1 2
2 1 3
2 2 5
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N, M, P = map(int, input().split())
  flg = 0
  for i in range(N-M+1, N+1):
    if gcd(i, P)!=1:
      flg = 1
      break
  if flg==1:
    print(-1)
  else:
    dp=[None]*M*N
    def idx(i,j):
      return i*N+j
    for j in reversed(range(N)):
      dp[idx(M-1,j)]=(j+1)%P
    adp=list(accumulate([dp[idx(M-1,j)] for j in reversed(range(N))]))[::-1]
    adp=[adp[i]%P for i in range(N)]
    for i in reversed(range(M-1)):
      for j in reversed(range(N)):
        dp[idx(i,j)]=(j+1)*((adp[j+1] if j!=N-1 else 0) +1)%P
      tmp=list(accumulate([dp[idx(i,j)] for j in reversed(range(N))]))[::-1]
      adp=[(tmp[j]+adp[j])%P for j in range(N)]
    ans=sum(dp)%P
    for i in range(N-M+1,N+1):
      ans=(ans*pow(i,P-2,P))%P
    print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)