#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

ifstream fin ("obiective.in");
ofstream fout ("obiective.out");

const int NMAX=32e3+5;

vector<int>comp[NMAX];
vector<int>rev[NMAX];
vector<int>v2[NMAX];
vector<int>v[NMAX];

stack<int>stiva;
int asc[25][NMAX];
int color[NMAX];
bool viz[NMAX];
int lvl[NMAX];
int kon;

void dfs(int p)
{
    viz[p]=true;
    for(auto i:v[p])
    {
        if(!viz[i])
            dfs(i);
    }
    stiva.push(p);
}

void dfsc(int p)
{
    viz[p]=true;
    color[p]=kon;
    comp[kon].push_back(p);
    for(auto i:rev[p])
    {
        if(!viz[i])
            dfsc(i);
    }
}

void dfs_euler(int p,int tata)
{
    int e;
    lvl[p]=lvl[tata]+1;
    for(e=1;e<=20;e++)
        asc[e][p]=asc[e-1][asc[e-1][p]];
    for(auto i:v2[p])
    {
        if(tata!=i)
        {
            asc[0][i]=p;
            dfs_euler(i,p);
        }
    }
}

int lca(int x,int y)
{
    int level,e;
    if(lvl[x]<lvl[y])
        swap(x,y);
    level=lvl[x]-lvl[y];
    for(e=20;e>=0;e--)
    {
        if(level & (1<<e))
            x=asc[e][x];
    }
    if(x==y)
        return x;
    for(e=20;e>=0;e--)
    {
        if(asc[e][x]!=asc[e][y])
        {
            x=asc[e][x];
            y=asc[e][y];
        }
    }
    return asc[0][x];
}


int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    int n,m,q,i,j;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
        rev[y].push_back(x);
    }
    for(i=1;i<=n;i++)
    {
        if(!viz[i])
            dfs(i);
    }
    for(i=1;i<=n;i++)
        viz[i]=false;
    while(!stiva.empty())
    {
        int p=stiva.top();
        if(!viz[p])
        {
            kon++;
            dfsc(p);
        }
        stiva.pop();
    }
    for(i=1;i<=n;i++)
    {
        for(auto j:v[i])
        {
            if(color[j]!=color[i])
                v2[color[i]].push_back(color[j]);
        }
    }
    dfs_euler(1,0);
    fin>>q;
    while(q--)
    {
        int x,y,lac;
        fin>>x>>y;
        lac=lca(color[x],color[y]);
        if(lac==color[x])
            fout<<0<<"\n";
        else
        {
            int total=0;
            x=color[x];
            for(int e=20;e>=0;e--)
            {
                if(asc[e][x]>0 && lvl[asc[e][x]]>=lvl[lac])
                {
                    total+=(1<<e);
                    x=asc[e][x];
                }
            }
            fout<<total<<"\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}