#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<int> edge[200005];
int dis[200005], in[200005], p[200005];
void bfs(int p) {
  memset(dis, -1, sizeof(dis));
  dis[p] = 0, in[p] = 0;
  queue<int> q;
  q.push(p);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    int size = edge[u].size();
    for (int i = 0; i < size; i++) {
      int v = edge[u][i];
      if (dis[v] == -1) {
        dis[v] = dis[u] + 1;
        q.push(v);
        in[v] = 1;
      } else if (dis[v] == dis[u] + 1)
        in[v] = 2;
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, m, k;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    edge[v].push_back(u);
  }
  cin >> k;
  for (int i = 1; i <= k; i++) cin >> p[i];
  bfs(p[k]);
  int ans1 = 0, ans2 = 0;
  for (int i = 1; i < k; i++) {
    if (dis[p[i]] == dis[p[i + 1]] + 1)
      ans2 += in[p[i]] - 1;
    else
      ans1++, ans2++;
  }
  cout << ans1 << ' ' << ans2;
  return 0;
}
