//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("obiective.in");
ofstream out("obiective.out");
int n,m,nr,p,c;
const int Max=32005;
vector < pair < int ,int > >gg[Max];
vector < int >d,dist,mat[Max]; bool viz[Max];
queue < int >q;
void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y;
        gg[x].push_back(make_pair(y,0));
        gg[y].push_back(make_pair(x,1));
    }
}

void initializare()
{
    d.push_back(0);
    for(int i=1;i<=n;i++)
      d.push_back(INT_MAX);
}

void Dijkstra(int x,int y)
{
   dist=d;

   dist[x]=0;
   q.push(x);
   while(!q.empty())
   {
       int nod=q.front();
       q.pop();
       for(int j=0;j<gg[nod].size();j++)
       {
           int vecin=gg[nod][j].first;
           int cost=gg[nod][j].second;
           if(dist[vecin]>dist[nod]+cost)
           {
               dist[vecin]=dist[nod]+cost;
               q.push(vecin);
           }

       }
   }


     out<<dist[y]<<"\n";
     mat[x]=dist;

   }





int main()
{
    citire();
    initializare();
      in>>p;
    for(int i=1;i<=p;i++)
    {
        int x,y;
        in>>x>>y;
        if(viz[x])
            out<<mat[x][y]<<"\n";
        else
        {
            viz[x]=1;
             Dijkstra(x,y);
        }

    }
    return 0;
}