#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001


unsigned long xor128() {
	static unsigned long x=123456789, y=362436069, z=521288629, w=88675123;
	unsigned long t=(x^(x<<11));
	x=y; y=z; z=w;
	return (w=(w^(w>>19))^(t^(t>>8)));
}

int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<int> A(M),B(M);
	vector<vector<int>> E(N);
	rep(i,M){
		cin>>A[i]>>B[i];
		A[i]--;B[i]--;
		E[A[i]].push_back(B[i]);
	}
	
	rep(i,N){
		vector<bool> visited(N,false);
		visited[i] = true;
		queue<int> Q;
		Q.push(i);
		while(Q.size()>0){
			int u = Q.front();
			Q.pop();
			
			rep(j,E[u].size()){
				int v = E[u][j];
				if(visited[v])continue;
				visited[v] = true;
				Q.push(v);
			}
		}
		
		rep(j,N){
			if(!visited[j]){
				cout<<-1<<endl;
				return 0;
			}
		}
	}
	
	vector<int> color(N,-1);

	stack<int> Q;
	Q.push(0);
	color[0] = 0;
	bool f0 = false,f1 = false;
	
	while(Q.size()>0){
		int u = Q.top();
		Q.pop();
		rep(i,E[u].size()){
			int v = E[u][i];
			if(color[v]==-1){
				color[v] = color[u]^1;
				Q.push(v);
			}
			else{
				if(color[u]!=color[v])continue;
				if(color[u]==0)f0=true;
				else f1=true;
				
				
			}
		}
	}
	
	if(!f0||!f1){
		cout<<-1<<endl;
		return 0;
	}

	string ans = "";
	int X = xor128()%N;
	rep(i,M){
		if(color[A[i]])ans += 'R';
		else ans += 'G';
		if(A[i] == X){
			color[A[i]] ^= 1;
		}
	}
	cout<<ans<<endl;
	
    return 0;
}