#include <bits/stdc++.h>
using namespace std;
vector<int> e[200010];
int d[200010], nu[200010], t[200010], a[200010];
int main() {
  int n, m, k, end, amax = 0, amin = 0;
  scanf("%d%d", &n, &m);
  for (int i = 0, u, v; i < m; i++) {
    scanf("%d%d", &u, &v);
    e[v].push_back(u);
  }
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) {
    scanf("%d", &end);
    nu[end] = i;
    a[i] = end;
  }
  queue<int> q;
  d[end] = 0;
  q.push(end);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int j = 0; j < e[x].size(); j++) {
      int u = e[x][j];
      if (!d[u] && u != end) {
        d[u] = d[x] + 1;
        q.push(u);
        t[u]++;
      } else if (d[u] == d[x] + 1)
        t[u]++;
    }
  }
  for (int i = 2; i <= k; i++) {
    if (d[a[i]] != d[a[i - 1]] - 1)
      amax++, amin++;
    else if (t[a[i - 1]] > 1)
      amax++;
  }
  printf("%d %d\n", amin, amax);
  return 0;
}
