Meeting Her

Urpal lives in a big city. He has planned to meet his lover tonight.

The city has n junctions numbered from 1 to n. The junctions are connected by m directed streets, all the roads have equal length. Urpal lives in junction a and the date is planned in a restaurant in junction b. He wants to use public transportation to get to junction b. There are k bus transportation companies. At the beginning of every second, a bus from the i-th company chooses a random shortest path between junction s i and junction t i and passes through it. There might be no path from s i to t i. In that case no bus will leave from s i to t i. If a bus passes through a junction where Urpal stands, he can get on the bus. He can also get off the bus at any junction along the path.

Now Urpal wants to know if it’s possible to go to the date using public transportation in a finite amount of time (the time of travel is the sum of length of the traveled roads) and what is the minimum number of buses he should take in the worst case.

At any moment Urpal knows only his own position and the place where the date will be. When he gets on the bus he knows only the index of the company of this bus. Of course Urpal knows the city map and the the pairs (s i, t i) for each company.

Note that Urpal doesn’t know buses velocity.

Input

The first line of the input contains four integers nmab (2 ≤ n ≤ 100; 0 ≤ m ≤ n·(n - 1); 1 ≤ a, b ≤ na ≠ b).

The next m lines contain two integers each u i and v i (1 ≤ u i, v i ≤ nu i ≠ v i) describing a directed road from junction u i to junction v i. All roads in the input will be distinct.

The next line contains an integer k (0 ≤ k ≤ 100). There will be k lines after this, each containing two integers s i and t i (1 ≤ s i, t i ≤ ns i ≠ t i) saying there is a bus route starting at s i and ending at t i. Please note that there might be no path from s i to t i, this case is described in the problem statement.

Output

In the only line of output print the minimum number of buses Urpal should get on on his way in the worst case. If it’s not possible to reach the destination in the worst case print -1.

Examples

input

7 8 1 71 21 32 43 44 64 56 75 732 71 45 7

output

2

input

4 4 1 21 21 32 43 411 4

output

-1

Solution:

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <memory.h>

using namespace std;

const int N = 111;

int st, fin, n, m, i, j, k, q, kt;
int a[N][N], b[N][N][N], g[N][N], ta[N], tb[N], ans[N], v[N];
vector <int> u[N][N];

int main() {
//  freopen("in", "r", stdin);
//  freopen("out", "w", stdout);
scanf("%d %d %d %d", &n, &m, &st, &fin);
st--; fin--;
memset(a, 0, sizeof(a));
for (i=0;i<m;i++) {
int qs, qf;
scanf("%d %d", &qs, &qf);
qs--; qf--;
a[qs][qf] = 1;
}
for (i=0;i<n;i++)
for (j=0;j<n;j++)
if (i == j) g[i][j] = 0; else
if (a[i][j]) g[i][j] = 1;
else g[i][j] = 424242;
for (k=0;k<n;k++)
for (i=0;i<n;i++)
for (j=0;j<n;j++)
if (g[i][k]+g[k][j] < g[i][j]) g[i][j] = g[i][k]+g[k][j];
scanf("%d", &kt);
for (i=0;i<kt;i++) {
scanf("%d %d", ta+i, tb+i);
ta[i]--; tb[i]--;
if (g[ta[i]][tb[i]] < 4242) {
for (j=0;j<=g[ta[i]][tb[i]];j++) {
u[i][j].clear();
for (k=0;k<n;k++)
if (g[ta[i]][k] == j && g[k][tb[i]] == g[ta[i]][tb[i]]-j) {
u[i][j].push_back(k);
b[i][j][k] = 1;
}
}
}
}
for (i=0;i<n;i++) ans[i] = 4242;
ans[fin] = 0;
int dd = 1, it = 0;
while (dd) {
dd = 0;
it++;
for (i=0;i<kt;i++) {
if (g[ta[i]][tb[i]] > 4242) continue;
v[tb[i]] = ans[tb[i]];
for (j=g[ta[i]][tb[i]]-1;j>=0;j--) {
int sz = u[i][j].size();
for (k=0;k<sz;k++) {
int w = u[i][j][k];
v[w] = 0;
for (q=0;q<n;q++)
if (a[w][q] && b[i][j+1][q])
if (v[q] > v[w]) v[w] = v[q];
if (ans[w] < v[w]) v[w] = ans[w];
}
if (sz == 1) {
int w = u[i][j][0];
if (ans[w] == 4242 && v[w] < it) {
ans[w] = it;
dd = 1;
}
}
}
}
}
printf("%d\n", (ans[st] < 4242) ? (ans[st]) : (-1));
return 0;
}