#include <fstream>
#include <vector>
#include <stack>
#include <queue>
#define NMAX 35002
using namespace std;
ifstream  fin("obiective.in");
ofstream fout("obiective.out");
int N,M,T,nrctc,c[NMAX],viz[NMAX],dist[NMAX];
vector<int> graph[NMAX],graph_tr[NMAX];
vector<pair<int,int>> graph_ctc[NMAX];
queue<int> q;
stack<int> stiva;

void citire()
{
    fin>>N>>M;

    int u,v;
    for(int i=1; i<=M; i++)
    {
        fin>>u>>v;
        graph[u].push_back(v);
        graph_tr[v].push_back(u);
    }

    fin>>T;
}

void DFS1(int nod)
{
    viz[nod]=1;
    for(int i=0; i<graph[nod].size(); i++)
    {
        int next_nod=graph[nod][i];
        if(!viz[next_nod])
        {
            DFS1(next_nod);
        }
    }
    stiva.push(nod);
}

void DFS2(int nod)
{
    c[nod]=nrctc;
    viz[nod]=0;
    for(int i=0; i<graph_tr[nod].size(); i++)
    {
        int next_nod=graph_tr[nod][i];
        if(viz[next_nod])
        {
            DFS2(next_nod);
        }
    }
}

void BFS(int start)
{
    for(int i=1; i<=nrctc; i++)
    {
        dist[i]=-1;
    }

    dist[start]=0;
    q.push(start);

    while(!q.empty())
    {
        int nod=q.front();
        q.pop();

        for(int i=0; i<graph_ctc[nod].size(); i++)
        {
            int next_nod=graph_ctc[nod][i].first;

            if(dist[next_nod]==-1)
            {
                dist[next_nod]=dist[nod]+graph_ctc[nod][i].second;
                q.push(next_nod);
            }
        }
    }
}

int main()
{
    citire();

    for(int i=1; i<=N; i++)
    {
        if(!viz[i])
        {
            DFS1(i);
        }
    }

    nrctc=0;
    while(!stiva.empty())
    {
        int nod=stiva.top();
        stiva.pop();

        if(viz[nod])
        {
            nrctc++;
            DFS2(nod);
        }
    }

    for(int i=1; i<=N; i++)
    {
        for(int j=0; j<graph[i].size(); j++)
        {
            int u,v;
            u=i;
            v=graph[i][j];
            if(c[u]!=c[v])
            {
                graph_ctc[c[u]].push_back({c[v],0});
                graph_ctc[c[v]].push_back({c[u],1});
            }
        }
    }

    int g,m;
    for(int q=1; q<=T; q++)
    {
        fin>>g>>m;

        if(c[g]==c[m])
        {
            fout<< 0;
        }
        else
        {
            BFS(c[g]);
            fout<< dist[c[m]];
        }
        fout<< "\n";
    }

    return 0;
}