#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int root[100100], cnt[100100];
int find_root(int u) { return root[u] == u ? u : root[u] = find_root(root[u]); }
void join(int u, int v) {
  u = find_root(u);
  v = find_root(v);
  if (u == v) return;
  if (cnt[u] < cnt[v]) swap(u, v);
  cnt[u] += cnt[v];
  root[v] = u;
}
int main() {
  int n, m, k;
  gn(n, m, k);
  for (int i = 1; i <= n; i++) root[i] = i, cnt[i] = 1;
  for (int u, v, i = 0; i < m; i++) {
    gn(u, v);
    join(u, v);
  }
  int ans = 1;
  int ct = 0;
  for (int i = 1; i <= n; i++)
    if (find_root(i) == i) {
      ct++;
      if (ct > 2) ans = (long long)ans * n % k;
      ans = (long long)ans * cnt[i] % k;
    }
  if (ct == 1) ans = 1;
  println(ans % k);
  return 0;
}
