#include <bits/stdc++.h>
using namespace std;
int N, M, K;
queue<int> Q;
vector<int> G[200005], GT[200005];
int P[200005];
bool Used[200005];
int Level[200005];
void Read() {
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= M; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    GT[v].push_back(u);
  }
  scanf("%d", &K);
  for (int i = 1; i <= K; i++) {
    scanf("%d", &P[i]);
  }
}
void BFS(int source) {
  Q.push(source);
  Used[source] = true;
  Level[source] = 1;
  while (!Q.empty()) {
    int node = Q.front();
    Q.pop();
    for (int i = 0; i < GT[node].size(); i++) {
      int neighb = GT[node][i];
      if (Used[neighb]) continue;
      Q.push(neighb);
      Used[neighb] = true;
      Level[neighb] = Level[node] + 1;
    }
  }
}
void Solve() {
  int Min = 0, Max = 0;
  for (int i = 1; i < K; i++) {
    int node = P[i];
    if (Level[P[i + 1]] > Level[node] - 1) {
      ++Min;
      ++Max;
      continue;
    }
    int add = 0;
    for (int j = 0; j < G[node].size(); j++) {
      int neighb = G[node][j];
      if (!Used[neighb] || neighb == P[i + 1]) continue;
      if (Level[neighb] == Level[node] - 1) {
        add = 1;
        break;
      }
    }
    Max += add;
  }
  printf("%d %d\n", Min, Max);
}
int main() {
  Read();
  BFS(P[K]);
  Solve();
  return 0;
}
