/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <math.h>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
unsigned long long MOD = 1e9 + 7;
ll INF = 1e18;
struct UnionFind
{
    vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2

    UnionFind(int N) : par(N)
    { //最初は全てが根であるとして初期化
        for (int i = 0; i < N; i++)
            par[i] = i;
    }

    int root(int x)
    { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
        if (par[x] == x)
            return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y)
    {                     // xとyの木を併合
        int rx = root(x); //xの根をrx
        int ry = root(y); //yの根をry
        if (rx == ry)
            return;   //xとyの根が同じ(=同じ木にある)時はそのまま
        par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
    }

    bool same(int x, int y)
    { // 2つのデータx, yが属する木が同じならtrueを返す
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
};
ll v, e;
VV gragh;
VV rgragh;
V in_num;
VV result;
V result_dfs;
V vec;
vector<bool> used;
void dfs(ll x)
{
    used[x] = true;
    rep(i, gragh[x].size())
    {
        if (!used[gragh[x][i]])
        {
            dfs(gragh[x][i]);
        }
    }
    result_dfs.push_back(x);
}
void rdfs(ll x)
{
  //  cout << x << " " << vec.size()<< endl;
    vec.push_back(x);
   // cout<<"Push_back"<<endl;
    used[x] = false;
    rep(i, rgragh[x].size())
    {
        if (used[rgragh[x][i]])
        {
            rdfs(rgragh[x][i]);
        }
    }
    
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> v >> e;
    gragh.resize(v);
    rgragh.resize(v);
    used.resize(v);
    UnionFind tree(v);
    rep(i, e)
    {
        ll s, t;
        cin >> s >> t;
        gragh[s].push_back(t);
        rgragh[t].push_back(s);
    }
    rep(i, v)
    {
        if (!used[i])
        {
            dfs(i);
        }
    }
   // cout<<result_dfs.size()<<endl;
   reverse(all(result_dfs));
  //  cout<<result_dfs.size()<<endl;
    rep(i, v)
    {
        V vec2;
        vec=vec2;
     //   cout<<result_dfs[i]<<endl;
        if (used[result_dfs[i]])
        {
            rdfs(result_dfs[i]);
        }
      //  cout<<"これがサイズだ！"<<vec.size()<<endl;
        rep(j, vec.size())
        {
            tree.unite(result_dfs[i], vec[j]);
        }
    }
    ll q;
    cin >> q;

    rep(i, v)
    {
     //   cout << tree.root(i) << " ";
    }
  //  cout << endl;
    rep(i, q)
    {
        ll s, t;
        cin >> s >> t;
     //   cout<<s<<" "<<t<<" ";
        if (tree.root(s) == tree.root(t))
        {
            cout << 1 << endl;
        }
        else
        {
            cout << 0 << endl;
        }
    }
}



Measured memory_bytes: 4836