// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

struct Graph{
  int n;
  vector<vector<int>> edge;
  vector<vector<int>> rev;
  vector<bool> used;
  vector<int> tn;
  vector<int> id;
  int cnt = 0;
  vector<vector<int>> scc_edge;
  Graph(){}
  Graph(int n): n(n){
    edge.resize(n);
    rev.resize(n);
    used.resize(n, false);
    id.resize(n);
  }
  void adde(int from, int to){
    edge[from].emplace_back(to);
    rev[to].emplace_back(from);
  }
  void dfs(int i){
    used[i] = true;
    for(auto e: edge[i]){
      if(!used[e])dfs(e);
    }
    tn.emplace_back(i);
  }
  void rev_dfs(int i, int cnt){
    used[i] = true;
    id[i] = cnt;
    for(auto e: rev[i]){
      if(!used[e]){
        rev_dfs(e, cnt);
      }
    }
  }
  int kosaraju(){
    tn.clear();
    fill(used.begin(), used.end(), false);

    for(int i = 0; i < n; i++){
      if(!used[i])dfs(i);
    }

    fill(used.begin(), used.end(), false);

    cnt = 0;
    for(int i = n - 1; i >= 0; i--){
      int v = tn[i];
      if(!used[v]){
        rev_dfs(v, cnt);
        cnt++;
      }
    }
    return cnt;
  }
  void compose(){
    scc_edge.resize(cnt);
    map<int, vector<int>> mp;
    for(int i = 0; i < n; i++)mp[id[i]].emplace_back(i);
    for(auto itr = mp.begin(); itr != mp.end(); ++itr){
      set<int> st;
      int at = id[(itr->second)[0]];
      for(auto v: itr->second){
        for(auto e: edge[v]){
          if(id[e] != at && st.find(id[e]) == st.end()){
            scc_edge[at].emplace_back(id[e]);
            st.insert(id[e]);
          }
        }
      }
    }
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  INT(n); INT(m);
  Graph graph(n);
  rep(i, m){
    int u, v;
    cin >> u >> v;
    graph.adde(u, v);
  }
  graph.kosaraju();
  int q;
  cin >> q;
  rep(i, q){
    int u, v;
    cin >> u >> v;
    cout << (graph.id[u] == graph.id[v] ? 1 : 0) << endl;
  }
  return 0;
}



Measured memory_bytes: 4496