#define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) begin(V), end(V)
#define ALLR(V) rbegin(V), rend(V)
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = pair<Node, Weight>;

template <bool Directed>
struct Graph : public VV<Edge> {
    using VV<Edge>::VV;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

}

namespace graph {

template <typename G>
class StronglyConnectedComponents {
    const G &graph;
    G rgraph;
    V<ll> label;
    V<ll> result;

    void dfs1(ll cur, ll &l) {
        label[cur] = -2;
        for (const graph::Edge &e : graph[cur]) {
            ll nxt;
            tie(nxt, ignore) = e;
            if (label[nxt] != -1) continue;
            dfs1(nxt, l);
        }
        label[cur] = l++;
    }

    void write_label() {
        ll l = 0;
        for (ll i = 0; i < graph.size(); i++) if (label[i] == -1) dfs1(i, l);
    }

    void dfs2(ll cur, ll l) {
        result[cur] = l;
        for (const graph::Edge &e : rgraph[cur]) {
            ll nxt;
            tie(nxt, ignore) = e;
            if (result[nxt] != -1) continue;
            dfs2(nxt, l);
        }
    }

    void build_scc() {
        ll l = 0;
        V<ll> ord(rgraph.size());
        iota(ALL(ord), 0ll);
        sort(ALL(ord), [&](ll i, ll j) { return label[i] > label[j]; });
        for (ll n : ord) if (result[n] == -1) dfs2(n, l++);
    }

public:
    StronglyConnectedComponents(const G &graph)
        : graph(graph), label(graph.size(), -1), result(graph.size(), -1) 
    {
        rgraph = graph.build_inv();
    }

    V<ll> build() {
        write_label();
        build_scc();
        return result;
    }
};

}

using SCC = graph::StronglyConnectedComponents<graph::Graph<true>>;

// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_C&lang=jp
int main() {
    ll N, M;
    cin >> N >> M;
    graph::Graph<true> g(N);
    while (M--) {
        ll s, t;
        cin >> s >> t;
        g.add_edge(s, t);
    }

    SCC scc(g);
    auto group = scc.build();
    ll Q;
    cin >> Q;
    while (Q--) {
        ll u, v;
        cin >> u >> v;
        bool ans = (group[u] == group[v]);
        cout << (ans ? 1 : 0) << endl;
    }
    return 0;
}



Measured memory_bytes: 4724