/* -*- coding: utf-8 -*-
 *
 * 2176.cc:  No.2176 LRM Question 1 - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_M = 1000000;

/* typedef */

typedef long long ll;

/* global variables */

int fs[MAX_M + 1], gs[MAX_M + 1];

/* subroutines */

/* main */

int main() {
  ll l, r;
  int m;
  scanf("%lld%lld%d", &l, &r, &m);

  if (l >= m) { puts("0"); return 0; }

  fs[0] = gs[0] = 1;
  int k = 1;
  for (; k < m; k++) {
    fs[k] = (ll)fs[k - 1] * k % m;
    gs[k] = (ll)gs[k - 1] * fs[k] % m;
    if (gs[k] == 0) break;
  }

  int sum = 0;
  for (int i = l; i <= r && gs[i] > 0; i++)
    sum = (sum + gs[i]) % m;

  printf("%d\n", sum);
  return 0;
}