#include <cstdio>
typedef long long ll;

int N;
ll P;
ll ans;

int main() {
  freopen("2018tree.in", "r", stdin);
  freopen("2018tree.out", "w", stdout);
  scanf("%d %lld", &N, &P);
  for (int i = 1; i <= N; ++i) {
    for (int j = i + 1; j <= N; ++j) {
      ans += j - i;
      ans %= P;
    }
  }
  for (int i = 1; i <= N; ++i) {
    ans = ans * i % P;
  }
  printf("%lld\n", ans);
}

int man() {
  int a, ans = 0;
  scanf("%d", &a);
  for (int i = 1; i <= a; ++i) {
    for (int j = i + 1; j <= a; ++j) {
      ans += j - i;
    }
  }
  printf("%d\n", ans);
  return 0;
}

int mai() {
  scanf("%d %lld", &N, &P);
  if (N == 1) {
    printf("0\n");
  } else if (N == 2) {
    printf("%lld\n", 2ll % P);
  } else if (N == 3) {
    printf("%lld\n", 24ll % P);
  } else if (N == 4) {
    printf("%lld\n", 240ll % P);
  } else if (N == 5) {
    printf("%lld\n", 2400ll % P);
  } else if (N == 6) {
    printf("%lld\n", 25200ll % P);
  } else if (N == 7) {
    printf("%lld\n", 282240ll % P);
  } else if (N == 8) {
    printf("%lld\n", 3386880ll % P);
  } else if (N == 9) {
    printf("%lld\n", 43545600 % P);
  } else if (N == 10) {
    printf("%lld\n", 598752000 % P);
  }
  return 0;
}