#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  for (int i = 0; i < int(a.size()); ++i)
    out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}
void smain();
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(4) << fixed;
  smain();
  return 0;
}
const int N = 2e5 + 10;
vector<int> g[N], rg[N];
int n, m;
int d[N];
int q[N + N];
void smain() {
  cin >> n >> m;
  for (int i = 0; i < int(m); ++i) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    rg[v].push_back(u);
  }
  int k;
  cin >> k;
  vector<int> p(k);
  for (int i = 0; i < int(k); ++i) {
    cin >> p[i];
  }
  d[p[k - 1]] = 1;
  int ql, qr;
  ql = qr = 0;
  q[qr++] = p[k - 1];
  while (ql < qr) {
    int v = q[ql++];
    for (int to : rg[v]) {
      if (!d[to]) {
        d[to] = d[v] + 1;
        q[qr++] = to;
      }
    }
  }
  int mx = 0, mn = 0;
  for (int i = 0; i < k - 1; ++i) {
    int v = p[i];
    int u = p[i + 1];
    int mnd = n + n + n;
    int cnt = 0;
    for (auto to : g[v]) {
      if (d[to] == mnd) {
        cnt++;
      } else if (d[to] < mnd) {
        mnd = d[to];
        cnt = 1;
      }
    }
    if (d[u] == mnd) {
      if (cnt > 1) {
        mx++;
      }
    } else {
      mx++;
      mn++;
    }
  }
  cout << mn << ' ' << mx;
}
