#include <bits/stdc++.h>
using namespace std;
long long int n, m, k;
long long int path[200005];
long long int dist[200005];
unordered_map<long long int, list<long long int> > h;
unordered_map<long long int, bool> multi;
unordered_map<long long int, list<long long int> > th;
void dijkstras(long long int node) {
  for (int i = 1; i <= n; i++) {
    dist[i] = INT_MAX;
  }
  priority_queue<pair<long long int, long long int>,
                 vector<pair<long long int, long long int> >,
                 greater<pair<long long int, long long int> > >
      pq;
  dist[node] = 0;
  pq.push(make_pair(0, node));
  while (!pq.empty()) {
    auto p = pq.top();
    pq.pop();
    for (auto child : th[p.second]) {
      if (dist[child] > 1 + dist[p.second]) {
        dist[child] = 1 + dist[p.second];
        pq.push(make_pair(dist[child], child));
      } else if (dist[child] == 1 + dist[p.second]) {
        multi[child] = true;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    long long int a, b;
    cin >> a >> b;
    h[a].push_back(b);
    th[b].push_back(a);
  }
  cin >> k;
  for (int i = 1; i <= k; i++) {
    cin >> path[i];
  }
  dijkstras(path[k]);
  int minV = 0;
  int maxV = 0;
  for (int i = 1; i < k; i++) {
    if (dist[path[i]] - 1 < dist[path[i + 1]]) {
      maxV++;
      minV++;
    } else if (multi[path[i]])
      maxV++;
  }
  cout << minV << " " << maxV << endl;
  return 0;
}
