The map of Bertown can be represented as a set of nn intersections, numbered from 11 to nn and connected by mm one-way roads. It is possible to move along the roads from any intersection to any other intersection. The length of some path from one intersection to another is the number of roads that one has to traverse along the path. The shortest path from one intersection vv to another intersection uu is the path that starts in vv, ends in uu and has the minimum length among all such paths.
Polycarp lives near the intersection ss and works in a building near the intersection tt. Every day he gets from ss to tt by car. Today he has chosen the following path to his workplace: p1p1, p2p2, ..., pkpk, where p1=sp1=s, pk=tpk=t, and all other elements of this sequence are the intermediate intersections, listed in the order Polycarp arrived at them. Polycarp never arrived at the same intersection twice, so all elements of this sequence are pairwise distinct. Note that you know Polycarp's path beforehand (it is fixed), and it is not necessarily one of the shortest paths from ss to tt.
Polycarp's car has a complex navigation system installed in it. Let's describe how it works. When Polycarp starts his journey at the intersection ss, the system chooses some shortest path from ss to tt and shows it to Polycarp. Let's denote the next intersection in the chosen path as vv. If Polycarp chooses to drive along the road from ss to vv, then the navigator shows him the same shortest path (obviously, starting from vv as soon as he arrives at this intersection). However, if Polycarp chooses to drive to another intersection ww instead, the navigator rebuilds the path: as soon as Polycarp arrives at ww, the navigation system chooses some shortest path from ww to tt and shows it to Polycarp. The same process continues until Polycarp arrives at tt: if Polycarp moves along the road recommended by the system, it maintains the shortest path it has already built; but if Polycarp chooses some other path, the system rebuilds the path by the same rules.
Here is an example. Suppose the map of Bertown looks as follows, and Polycarp drives along the path 1,2,3,41,2,3,4 (s=1s=1, t=4t=4):
Check the picture by the link http://tk.codeforces.com/a.png
- When Polycarp starts at 11, the system chooses some shortest path from 11 to 44. There is only one such path, it is 1,5,41,5,4;
- Polycarp chooses to drive to 22, which is not along the path chosen by the system. When Polycarp arrives at 22, the navigator rebuilds the path by choosing some shortest path from 22 to 44, for example, 2,6,42,6,4 (note that it could choose 2,3,42,3,4);
- Polycarp chooses to drive to 33, which is not along the path chosen by the system. When Polycarp arrives at 33, the navigator rebuilds the path by choosing the only shortest path from 33 to 44, which is 3,43,4;
- Polycarp arrives at 44 along the road chosen by the navigator, so the system does not have to rebuild anything.
Overall, we get 22 rebuilds in this scenario. Note that if the system chose 2,3,42,3,4 instead of 2,6,42,6,4 during the second step, there would be only 11 rebuild (since Polycarp goes along the path, so the system maintains the path 3,43,4 during the third step).
The example shows us that the number of rebuilds can differ even if the map of Bertown and the path chosen by Polycarp stays the same. Given this information (the map and Polycarp's path), can you determine the minimum and the maximum number of rebuilds that could have happened during the journey?
Input
The first line contains two integers nn and mm (2≤n≤m≤2⋅1052≤n≤m≤2⋅105) --- the number of intersections and one-way roads in Bertown, respectively.
Then mm lines follow, each describing a road. Each line contains two integers uu and vv (1≤u,v≤n1≤u,v≤n, u≠vu≠v) denoting a road from intersection uu to intersection vv. All roads in Bertown are pairwise distinct, which means that each ordered pair (u,v)(u,v) appears at most once in these mm lines (but if there is a road (u,v)(u,v), the road (v,u)(v,u) can also appear).
The following line contains one integer kk (2≤k≤n2≤k≤n) --- the number of intersections in Polycarp's path from home to his workplace.
The last line contains kk integers p1p1, p2p2, ..., pkpk (1≤pi≤n1≤pi≤n, all these integers are pairwise distinct) --- the intersections along Polycarp's path in the order he arrived at them. p1p1 is the intersection where Polycarp lives (s=p1s=p1), and pkpk is the intersection where Polycarp's workplace is situated (t=pkt=pk). It is guaranteed that for every i∈1,k−1i∈1,k−1 the road from pipi to pi+1pi+1 exists, so the path goes along the roads of Bertown.
Output
Print two integers: the minimum and the maximum number of rebuilds that could have happened during the journey.
Examples
input
Copy
6 9
1 5
5 4
1 2
2 3
3 4
4 1
2 6
6 4
4 2
4
1 2 3 4output
Copy
1 2input
Copy
7 7
1 2
2 3
3 4
4 5
5 6
6 7
7 1
7
1 2 3 4 5 6 7output
Copy
0 0input
Copy
8 13
8 7
8 6
7 5
7 4
6 5
6 4
5 3
5 2
4 3
4 2
3 1
2 1
1 8
5
8 7 5 2 1output
Copy
0 3思路：
1，正向的想很复杂，反向建图更加有力
2，涉及最短路=》dj反向建图找最短距离=》正向的从p1到pk，看dist【u】==dist【v】+1？是否有多个路径：mx++，mn++;
3，为什么看是否有多个路径，因为最短路径事前确定，但是不一定是当前路径，也是mx》=mn的原因
代码：
cpp
int ksm(int a,int b){//快速幂
int ans=1;
while(b){
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
int log2(int a){
return floor(log(a)/log(2));
}
int lower_bit(int x){
return x&(-x);
}
struct qnode{
int v;
int c;
qnode(int _v=0,int _c=0):v(_v),c(_c){}
bool operator < (const qnode &r)const {
return c>r.c;
}
};
struct edge{
int v,cost;
edge(int _v=0,int _cost=0):v(_v),cost(_cost){}
};
vector<edge>g[maxj],z[maxj];
bool vis[maxj];
int dist[maxj];
void add1(int u,int v,int w){
g[u].push_back(edge(v,w));
}
void add2(int u,int v,int w){
z[u].push_back(edge(v,w));
}
int n;
void dj(int st){
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;++i)dist[i]=inf;
priority_queue<qnode>que;
while(!que.empty())que.pop();
dist[st]=0;
que.push(qnode(st,0));
qnode tmp;
while(!que.empty()){
tmp=que.top();que.pop();
int u=tmp.v;
if(vis[u])continue;
vis[u]=1;
for(int i=0;i<g[u].size();++i){
int v=g[tmp.v][i].v;
int cost = g[u][i].cost;
if(!vis[v]&&dist[v]>dist[u]+cost){
dist[v]=dist[u]+cost;
que.push(qnode(v,dist[v]));
}
}
}
}
int a[maxj];
void solve(){
int m;
cin>>n>>m;
rep(i,1,m){
int x,y;cin>>x>>y;
add1(y,x,1);
add2(x,y,1);
}
int k;cin>>k;
rep(i,1,k)cin>>a[i];
dj(a[k]);
int mn=0,mx=0;
rep(i,1,k-1){
int u=a[i],v=a[i+1];
if(dist[v]==dist[u]-1){
for(int j=0;j<z[u].size();++j){
int to=z[u][j].v;
if(dist[u]==dist[to]+1&&to!=v){
mx++;
break;
}
}
}else{
mn++,mx++;
}
}cout<<mn<<' '<<mx<<'\n';
}