/// Preset de infoarena
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int maxN = 32005;
int n, m, q, nrctc, comp[maxN], ll[maxN], depth[maxN];
int s[16][maxN], sus[16][maxN];
vector <int> G[maxN], Gback[maxN], G2[maxN], ordine; /// let's go g2
bool used[maxN];

void dfs1(int nod)
{
    used[nod] = 1;
    for(int vecin : G[nod])
        if(!used[vecin])
            dfs1(vecin);
    ordine.push_back(nod);
}

void dfs2(int nod)
{
    used[nod] = 1;
    comp[nod] = nrctc;
    for(int vecin : Gback[nod])
        if(!used[vecin])
            dfs2(vecin);
}

void dfs(int nod)
{
    used[nod] = 1;
    for(int vecin : G2[nod])
        if(!ll[vecin] || depth[nod] < depth[ll[nod]])
            ll[vecin] = nod;
    for(int vecin : G2[nod])
    {
        if(used[vecin])
            continue;
        s[0][vecin] = nod;
        depth[vecin] = depth[nod] + 1;
        dfs(vecin);
        if(!ll[nod] || depth[ll[vecin]] < depth[ll[nod]])
            ll[nod] = ll[vecin];
    }
}

int get_lca(int x, int y)
{
    if(depth[x] > depth[y])
        swap(x, y);
    int diff = depth[y] - depth[x];
    for(int i = 15; i >= 0; i--)
        if(diff & (1 << i))
            y = s[i][y];
    for(int i = 15; i >= 0; i--)
    {
        if(s[i][x] != s[i][y])
        {
            x = s[i][x];
            y = s[i][y];
        }
    }
    if(x != y)
        x = s[0][x];
    return x;
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        Gback[y].push_back(x);
    }
    for(int i = 1; i <= n; i++)
        if(!used[i])
            dfs1(i);
    for(int i = 1; i <= n; i++)
        used[i] = 0;
    reverse(ordine.begin(), ordine.end());
    for(int elem : ordine)
    {
        if(used[elem])
            continue;
        nrctc++;
        dfs2(elem);
    }
    for(int i = 1; i <= n; i++)
        used[i] = 0;
    for(int nod = 1; nod <= n; nod++)
    {
        for(int vecin : G[nod])
        {
            if(comp[nod] == comp[vecin])
                continue;
            G2[comp[nod]].push_back(comp[vecin]);
            used[comp[vecin]] = 1;
        }
    }
    int root;
    for(int i = 1; i <= nrctc; i++)
    {
        sort(G2[i].begin(), G2[i].end());
        G2[i].erase(unique(G2[i].begin(), G2[i].end()), G2[i].end());
        if(used[i] == 0)
            root = i;
        used[i] = 0;
    }
    dfs(root);
    for(int j = 1; (1 << j) <= nrctc; j++)
        for(int i = 1; i <= nrctc; i++)
            s[j][i] = s[j - 1][s[j - 1][i]];
    for(int i = 1; i <= nrctc; i++)
        sus[0][i] = ll[i];
    for(int j = 1; (1 << j) <= nrctc; j++)
        for(int i = 1; i <= nrctc; i++)
            sus[j][i] = sus[j - 1][sus[j - 1][i]];
    fin >> q;
    while(q--)
    {
        int x, y;
        fin >> x >> y;
        x = comp[x], y = comp[y];
        int lvl = depth[get_lca(x, y)];
        int ans = 0;
        for(int j = 15; j >= 0; j--)
        {
            if(depth[sus[j][x]] > lvl)
            {
                x = sus[j][x];
                ans += (1 << j);
            }
        }
        if(depth[x] > lvl)
            ans++;
        fout << ans << '\n';
    }
    return 0;
}