int n,q;
 cin>>n>>q;
 vector<char>v(2*n);
 cin(v);
 deque<int>d;
 for(int i=0;i<v.size();i++){
  if(v[i]=='L'){
    d.push_front(v[i+1]);
  }else if(v[i]=='R'){
    d.push_back(v[i+1]);
  }
 }
 cout(d);
 map<int,vector<int>>mp;
 for(int i=0;i<d.size();i++){
  mp[d[i]].push_back(i);
 }
 while(q--){
  int num;
  cin>>num;
  for(int j=0;j<mp[num].size();j++){
    if(mp[num][j]<n/2){
      cout<<"Left"<<"\n";
    }else{
      cout<<"Right"<<"\n";
    }
  }cout<<"\n";
 }