#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    int weight;
    Edge(int t, int w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    int weight;
    edge(int f,int t,int w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = 1e18+7;

constexpr int INF = 1e9+7;

vector<int> dx = {-1,0,1,0,-1,1,-1,1};
vector<int> dy = {0,-1,0,1,1,-1,-1,1};

/* template */

struct StronglyConnectedComponents{
    private:
      int n,k;
      graph g,rg,scc_g;
      vector<bool> used;
      vector<int> vs;
      vector<int> cmp;

      void dfs(int v){
          used[v] = true;
          for(auto &nv: g[v]){
              if(!used[nv]) dfs(nv);
          }
          vs.emplace_back(v);
      }

      void rdfs(int v,int k){
          used[v] = true;
          cmp[v] = k;
          for(auto &nv: rg[v]){
              if(!used[nv]) rdfs(nv,k);
          }
      }
    
    public:
      StronglyConnectedComponents(const graph &g) : n(g.size()),g(g),rg(g.size()),used(g.size(),false),cmp(g.size(),0) {
          for(int v=0; v<n; v++){
              for(auto &nv: g[v]){
                  rg[nv].emplace_back(v);
              }
          }
          for(int v=0; v<n; v++){
              if(!used[v]) dfs(v);
          }
          used.assign(n,false);
          reverse(vs.begin(),vs.end());
          k = 0;
          for(auto &v: vs){
              if(!used[v]) rdfs(v,k++);
          }
          scc_g.resize(k);
          for(int v = 0; v<n; v++){
              for(auto &nv: g[v]){
                  int s = cmp[v], t = cmp[nv];
                  if(s!=t){
                      scc_g[s].emplace_back(t);
                  }
              }
          }
      }

      int operator[](int index){ return cmp[index]; }

      bool same(int u,int v){ return (cmp[u]==cmp[v]); }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int v,e; cin >> v >> e;
    graph g(v);
    rep(i,0,e){
        int s,t; cin >> s >> t;
        g[s].emplace_back(t);
    }
    StronglyConnectedComponents scc(g);
    int q; cin >> q;
    rep(_,0,q){
        int u,v; cin >> u >> v;
        cout << scc.same(u,v) << endl;
    }
}


Measured memory_bytes: 5020