#include <bits/stdc++.h>
using namespace std;
template <class A>
void rd(vector<A>& v);
template <class T>
void rd(T& x) {
  cin >> x;
}
template <class H, class... T>
void rd(H& h, T&... t) {
  rd(h);
  rd(t...);
}
template <class A>
void rd(vector<A>& x) {
  for (auto& a : x) rd(a);
}
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
void __p(T a) {
  cout << a;
}
template <typename T, typename F>
void __p(pair<T, F> a) {
  cout << "{";
  __p(a.first);
  cout << ",";
  __p(a.second);
  cout << "}\n";
}
template <typename T>
void __p(std::vector<T> a) {
  cout << "{";
  for (auto it = a.begin(); it < a.end(); it++)
    __p(*it), cout << ",}\n"[it + 1 == a.end()];
}
template <typename T, typename... Arg>
void __p(T a1, Arg... a) {
  __p(a1);
  __p(a...);
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : ";
  __p(arg1);
  cout << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  int64_t bracket = 0, i = 0;
  for (;; i++)
    if (names[i] == ',' && bracket == 0)
      break;
    else if (names[i] == '(')
      bracket++;
    else if (names[i] == ')')
      bracket--;
  const char* comma = names + i;
  cout.write(names, comma - names) << " : ";
  __p(arg1);
  cout << " | ";
  __f(comma + 1, args...);
}
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
  cout.precision(15);
  cout << fixed;
  if (((int64_t)(s).size())) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
int64_t determinant(vector<vector<int64_t>> M, int64_t P) {
  function<int64_t(int64_t)> inv = [&](int64_t x) {
    int64_t a = x, b = P - 2, ans = 1;
    for (; b; b /= 2, a = (a * a) % P)
      if (b & 1) ans = (ans * a) % P;
    return ans;
  };
  int64_t det = 1;
  int64_t n = M.size();
  for (int64_t i = 0; i < n; ++i) {
    int64_t select = i;
    for (int64_t j = i + 1; j < n; ++j) {
      if (abs(M[j][i]) > abs(M[select][i])) select = j;
    }
    if (!M[select][i]) return 0;
    if (select != i) {
      swap(M[i], M[select]);
      det *= -1;
    }
    det *= M[i][i];
    det %= P;
    for (int64_t j = i + 1; j < n; ++j) {
      M[i][j] *= inv(M[i][i]);
      M[i][j] %= P;
    }
    for (int64_t j = 0; j < n; ++j) {
      if (i == j) continue;
      for (int64_t k = i + 1; k < n; ++k) {
        M[j][k] -= M[i][k] * M[j][i];
        M[j][k] %= P;
      }
    }
  }
  if (det < 0) det += P;
  det %= P;
  return det;
}
signed main() {
  setIO();
  int64_t n, m, p;
  rd(n, m, p);
  vector<int64_t> g[n], in(n, 0), out(n, 0);
  vector<vector<int64_t>> dp(n, vector<int64_t>(n, 0));
  for (int64_t _ = int64_t(0); _ < int64_t(m); ++_) {
    int64_t u, v;
    rd(u, v);
    --u, --v;
    g[u].push_back(v);
    in[v]++, out[u]++;
  }
  for (int64_t i = int64_t(0); i < int64_t(n); ++i) dp[i][i] = 1;
  queue<int64_t> q;
  for (int64_t i = int64_t(0); i < int64_t(n); ++i)
    if (!in[i]) q.push(i);
  while (((int64_t)(q).size())) {
    int64_t i = q.front();
    q.pop();
    for (auto j : g[i]) {
      for (int64_t k = int64_t(0); k < int64_t(n); ++k)
        dp[k][j] += dp[k][i], dp[k][j] %= p;
      if (!(--in[j])) q.push(j);
    }
  }
  in.assign(n, 0);
  out.assign(n, 0);
  for (int64_t i = int64_t(0); i < int64_t(n); ++i) {
    for (auto j : g[i]) {
      in[j]++, out[i]++;
    }
  }
  int64_t src = 0;
  for (int64_t i = int64_t(0); i < int64_t(n); ++i) src += in[i] == 0;
  vector<vector<int64_t>> mat(src, vector<int64_t>(src));
  int64_t xi = 0, xj = 0;
  for (int64_t i = int64_t(0); i < int64_t(n); ++i) {
    if (!in[i]) {
      xj = 0;
      for (int64_t j = int64_t(0); j < int64_t(n); ++j) {
        if (!out[j]) {
          mat[xi][xj] = dp[i][j];
          xj++;
        }
      }
      assert(xj == src);
      xi++;
    }
  }
  assert(xi == src);
  cout << determinant(mat, p);
}
