#include <bits/stdc++.h>
using namespace std;
long long INF = LLONG_MAX;
long long const mxn = 2e5 + 5;
int n, m, k, st, en, dep[mxn], vis[mxn], path[mxn], cnt[mxn];
vector<int> G[mxn], R[mxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  int u, v;
  for (int i = 0; i < mxn; i++) {
    dep[i] = 1e9;
    vis[i] = 0;
    cnt[i] = 0;
  }
  for (int i = 0; i < m; i++) {
    cin >> u >> v;
    G[u].push_back(v);
    R[v].push_back(u);
  }
  cin >> k;
  for (int i = 1; i <= k; i++) {
    cin >> path[i];
  }
  st = path[1];
  en = path[k];
  dep[en] = 0;
  queue<int> q;
  q.push(en);
  while (!q.empty()) {
    u = q.front();
    q.pop();
    if (vis[u]) continue;
    vis[u] = 1;
    for (int v : R[u]) {
      if (dep[v] > dep[u] + 1) {
        dep[v] = dep[u] + 1;
        q.push(v);
      }
    }
  }
  for (u = 1; u <= n; u++) {
    for (int v : G[u]) {
      if (dep[v] == dep[u] - 1) {
        cnt[u]++;
      }
    }
  }
  int mn = 0, mx = 0;
  for (int i = 1; i < k; i++) {
    int cur = path[i];
    int nxt = path[i + 1];
    if (dep[cur] == dep[nxt] + 1) {
      if (cnt[cur] > 1) mx++;
    } else
      mn++;
  }
  cout << mn << ' ' << mx + mn << endl;
}
