#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, q;
int par[N];
set <int> cur[N], nt[N];

int fin(int u){
    if (u == par[u]) return u; return par[u] = fin(par[u]);
}

void solve(){
    cin >> n >> m >> q;
    for (int i = 1; i <= n; ++ i){
        par[i] = i;
        cur[i].insert(i);
    }

    for (int i = 1; i <= m; ++ i){
        int u, v; cin >> u >> v;
        nt[u].insert(v);
        nt[v].insert(u);
    }

    for (int i = 1; i <= q; ++ i){
        int u, v; cin >> u >> v;
        u = fin(u); v = fin(v);
        if (nt[u].size() > nt[v].size()) swap(u, v);
        bool ck = true;
        for (int dhs : nt[u]) if (cur[v].find(dhs) != cur[v].end()){
            cout << "REFUSE" << '\n';
            ck = false;
            break;
        }

        if (ck){
            cout << "APPROVE" << '\n';
            par[u] = v;
            if (cur[u].size() > cur[v].size()) swap(cur[u], cur[v]);
            for (int dhs : cur[u]) cur[v].insert(dhs); cur[u].clear();
            for (int dhs : nt[u]) nt[v].insert(dhs); nt[u].clear();
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}