#include using namespace std; typedef long long int ll; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef pair pii; typedef pair pll; #define rep(i,l,r) for(int i=(l);i<(r);i++) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b using namespace atcoder; int main(){ int N,M;cin>>N>>M; if(M%2){cout<<-1<A(M); rep(i,0,M)cin>>A[i].F>>A[i].S; rep(i,0,M)A[i].F--,A[i].S--; if(count(all(A),pii(0,N-1))){cout<<-1<M/2){ rep(i,0,M)if(A[i].S==N-1)ans[i]='B',B--; dsu D(N); rep(i,0,M)if(A[i].F)D.merge(A[i].F,A[i].S); assert(D.size(N-1)<=1+M-sz(E[0])); rep(i,0,M)if(A[i].S!=N-1){ if(B){ if(A[i].F==0&&!D.same(A[i].S,N-1))ans[i]='B',B--; else if(A[i].F)ans[i]='B',B--; else ans[i]='R',R--; } else ans[i]='R'; } } else{ rep(i,0,M)if(A[i].F==0)ans[i]='B',B--; dsu D(N); rep(i,0,M)if(A[i].S!=N-1)D.merge(A[i].F,A[i].S); assert(D.size(0)<=1+M-sz(E[N-1])); rep(i,0,M)if(A[i].F){ if(B){ if(A[i].S==N-1&&!D.same(A[i].F,0))ans[i]='B',B--; else if(A[i].S!=N-1)ans[i]='B',B--; else ans[i]='R',R--; } else ans[i]='R'; } } cout<