#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int t = 1;
const int N = 2e5 + 10;
const int INF = 1e9 + 10;
int n, m, k, p[N];
vector<int> adj[N];
int F[N], d[N];
void bfs(int t) {
  for (int i = 1; i <= n; i++) F[i] = INF, d[i] = 0;
  F[t] = 0;
  queue<int> Q;
  Q.push(t);
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    for (int v : adj[u])
      if (F[v] == INF) {
        F[v] = F[u] + 1;
        d[v]++;
        Q.push(v);
      } else if (F[v] == F[u] + 1) {
        d[v]++;
      }
  }
}
void solve() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adj[v].push_back(u);
  }
  cin >> k;
  for (int i = 1; i <= k; i++) cin >> p[i];
  bfs(p[k]);
  int minAns = 0, maxAns = 0;
  for (int i = 2; i <= k; i++) {
    int u = p[i - 1];
    int v = p[i];
    if (F[u] - 1 != F[v]) {
      minAns++;
      maxAns++;
    } else {
      if (d[u] > 1) maxAns++;
    }
  }
  cout << minAns << ' ' << maxAns;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  if (fopen("..."
            ".inp",
            "r")) {
    freopen(
        "..."
        ".inp",
        "r", stdin);
    freopen(
        "..."
        ".out",
        "w", stdout);
  }
  while (t--) {
    solve();
  }
}
