#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int M = 30000;
const long long base = 137;
const long long mod = 1000000007LL;
using namespace std;
vector<int> adj[N], adj_rev[N];
int n, m, k, a[N], d[N];
void BFS(int s, int t) {
  queue<int> q;
  q.push(s);
  d[s] = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : adj_rev[u]) {
      if (d[v] == -1) {
        d[v] = d[u] + 1;
        q.push(v);
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  while (m--) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj_rev[v].push_back(u);
  }
  int k;
  cin >> k;
  for (int i = 1; i <= k; ++i) cin >> a[i];
  fill(d + 1, d + n + 1, -1);
  BFS(a[k], a[1]);
  int res1 = 0, res2 = 0;
  for (int i = 1; i < k; ++i) {
    if (d[a[i]] != d[a[i + 1]] + 1)
      ++res1, ++res2;
    else {
      int cnt = 0;
      for (int j : adj[a[i]])
        if (d[j] == d[a[i]] - 1) {
          ++cnt;
        }
      if (cnt > 1) ++res2;
    }
  }
  cout << res1 << ' ' << res2;
  return 0;
}
