#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 5;
int n, m, s;
struct Node {
  int next, to;
} edge[maxn * 2], edge2[maxn * 2];
int size = 0, size2 = 0;
int head[maxn], head2[maxn];
void add_edge(int x, int y) {
  edge[size].to = y;
  edge[size].next = head[x];
  head[x] = size++;
}
void add_edge2(int x, int y) {
  edge2[size2].to = y;
  edge2[size2].next = head2[x];
  head2[x] = size2++;
}
queue<int> q;
int dis[maxn], vis[maxn], p[maxn];
int dgree[maxn];
void bfs(int start) {
  dis[start] = 0;
  vis[start] = 1;
  while (!q.empty()) q.pop();
  q.push(start);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int i = head[x]; i != -1; i = edge[i].next) {
      int y = edge[i].to;
      if (!vis[y]) {
        dis[y] = dis[x] + 1;
        vis[y] = 1;
        q.push(y);
      }
    }
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  size = 1;
  for (int i = 1; i <= n; i++) head2[i] = head[i] = -1, vis[i] = 0;
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add_edge(v, u);
    add_edge2(u, v);
  }
  int k;
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) scanf("%d", &p[i]);
  bfs(p[k]);
  for (int i = 1; i <= n; i++) {
    for (int j = head2[i]; j != -1; j = edge2[j].next) {
      int y = edge2[j].to;
      if (dis[y] + 1 == dis[i]) dgree[i]++;
    }
  }
  int minans = 0, maxans = 0;
  for (int i = 2; i <= k; i++) {
    if (dis[p[i]] - dis[p[i - 1]] != -1) {
      minans++, maxans++;
    } else if (dgree[p[i - 1]] > 1)
      maxans++;
  }
  cout << minans << " " << maxans << endl;
  return 0;
}
