#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream f("obiective.in");
ofstream g("obiective.out");
vector<int>a[32002],inv[32002],ctc[32002],arb[32002];
int n,k,kk[32002],ktk[32002],gr[32002],niv[32002];
bool viz[32002];
struct elem
{
    int x,niv;
};
elem v[64002],rmq[64002][20];
int puteri[64002],e[64002],ap[32002];

void dfs(int x)
{
    viz[x]=1;
    for(auto y:a[x])
    if(viz[y]==0)
        dfs(y);
    kk[++k]=x;
}

void dfs_inv(int x)
{
    viz[x]=1;
    ctc[k].push_back(x);
    ktk[x]=k;
    for(auto y:inv[x])
    if(viz[y]==0)
        dfs_inv(y);
}

void kosaraju()
{
    int i;
    for(i=1;i<=n;i++)
    if(viz[i]==0)
        dfs(i);
    for(i=1;i<=n;i++)
        viz[i]=0;
    k=0;
    for(i=n;i>=1;i--)
    if(viz[kk[i]]==0)
    {
        k++;
        dfs_inv(kk[i]);
    }
}

void dfs_arbore(int x,int tata)
{
    int n=arb[x].size(),i;
    niv[x]=niv[tata]+1;
    v[++k].x=x;
    v[k].niv=niv[x];
    for(i=0;i<n;i++)
    {
        dfs_arbore(arb[x][i],x);
        v[++k].x=x;
        v[k].niv=niv[x];
    }
}

void rmqlca()
{
    int i,p,q=1;
    for(i=1;i<=k;i++)
        rmq[i][0]=v[i];
    for(p=1;p*2<=k;p*=2)
    {
        for(i=1;i<=k-p*2+1;i++)
        if(rmq[i][q-1].niv<rmq[i+p][q-1].niv)
            rmq[i][q]=rmq[i][q-1];
        else
            rmq[i][q]=rmq[i+p][q-1];
        q++;
    }
    p=1;
    q=0;
    for(i=1;i<=k;i++)
    {
        if(p*2<=i)
            p*=2,q++;
        puteri[i]=p;
        e[i]=q;
    }
}

int lca(int x,int y)
{
    int l;
    x=ap[x];
    y=ap[y];
    if(x>y)
        swap(x,y);
    l=y-x+1;
    if(rmq[x][e[l]].niv<rmq[y-puteri[l]+1][e[l]].niv)
        return rmq[x][e[l]].x;
    else
        return rmq[y-puteri[l]+1][e[l]].x;
}

int main()
{
    int m,i,x,y,root,t,z;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
        inv[y].push_back(x);
    }
    kosaraju();
    for(i=1;i<=k;i++)
    for(auto x:ctc[i])
    for(auto y:a[x])
    if(ktk[x]!=ktk[y])
        arb[ktk[x]].push_back(ktk[y]),gr[ktk[y]]++;
    for(i=1;i<=k;i++)
    if(gr[i]==0)
    {
        root=i;
        break;
    }
    k=0;
    dfs_arbore(root,0);
    rmqlca();
    for(i=1;i<=k;i++)
    if(ap[v[i].x]==0)
        ap[v[i].x]=i;
    f>>t;
    for(i=1;i<=t;i++)
    {
        f>>x>>y;
        x=ktk[x];
        y=ktk[y];
        z=lca(x,y);
        g<<max(niv[x]-niv[z],0)<<'\n';
    }
    return 0;
}