#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<pii, int> para;
const ll inf = 1e18 + 7;
const int maxN = 1e6 + 5;

int n, m, q;
vi graph[maxN], graphRev[maxN];
int cnt[maxN], t;
bool used[maxN];
vi vec;

void DFS(int v) {
	used[v] = true;
	for (auto x: graph[v]) {
		if (!used[x]) {
			DFS(x);
		}
	}
	vec.pb(v);
}

void DFSRev(int v) {
	used[v] = true;
	cnt[v] = t;
	for (auto x: graphRev[v]) {
		if (!used[x]) {
			DFSRev(x);
		}
	}
}

void SSS() {
	RI(i, n) {
		if (!used[i])
			DFS(i);
	}
	RI(i, n) used[i] = false;
	reverse(vec.begin(), vec.end());
	for (auto v: vec) {
		if (!used[v]) {
			DFSRev(v);
			t++;
		}
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin >> n >> m;
	REP(_, m) {
		int a, b;
		cin >> a >> b;
		graph[a].pb(b);
		graphRev[b].pb(a);
	}
	SSS();
	cin >> q;
	REP(_, q) {
		int a, b;
		cin >> a >> b;
		if (cnt[a] == cnt[b]) {
			cout << "MISJA UDANA\n";
		} else {
			cout << "MISJA NIEUDANA\n";
		}
	}
	return 0;
}