// TFlip.cc
//ecna 2009
//problem D - FLipper

#include  <iostream>
using namespace std;

const int MAX = 101;
int R, L, n;           // R = pos of right pile, L = pos of left pile
int Piles[MAX][MAX];
int UpDown[MAX];

// for debugging
void PrintInfo(){
  cout<<L<<' '<<R<<' ';
  for(int k=1;k<=n;k++) cout<<UpDown[k];
  cout<<endl;
  cout<<"left: ";
  for(int k=L-1;k>-1;k--)
    cout<<Piles[L][k];
  cout<<"  right:";
  for(int k=n-R; k>-1;k--)
    cout<<Piles[R][k];
  cout<<endl;
}

// get initial configuration
void InitPiles(){
  char C;
  R = n; L = 1;
  for(int i=1;i<=n;i++){
    Piles[i][0]=i;
  }
  //get up/down
  for(int i=1;i<=n;i++){
    cin>>C;
    if (C == 'U')  UpDown[i] = 1;     // 1  = up
    else           UpDown[i] = -1;    // -1 =  down
  }
}

// for debugging
void PrintPile(){
  cout<<"L="<<L<<" R="<<R<<endl;
  if(L==R){
   for(int k=n-1; k>-1;k--)
    cout<<Piles[L][k];
   cout<<endl;
   for (int k=n-1;k>-1;k--)
    if(UpDown[Piles[L][k]]==1) cout<<'U';
    else cout<<'D';
   cout<<endl;
  }
}

// perform the required flips
void DoFlips(){
  char f;
  int  j;
  //do first n-2 flips (flip pile  onto single card)
  for(int i=0;i<n-2;i++){ 
    cin >> f;
    if (f=='R'){
      // rightmost pile if at position R and has n-R+1  cards  
      // flip them onto pos R-1
      j = 1;   // j = pos on pile R-1
      for(int k=n-R; k>-1;k--)
        Piles[R-1][j++] = Piles[R][k]; 
     //now flip all cards from position  R thru n
     for(int k=R; k<=n;k++)
       UpDown[k] *=  -1;
     R--;     //move right pile pointer
    }

    else {    // f == 'L'
      // left pile at  pos L has L cards
      j = 1;   // j =  pos  pn pile L+1
      for(int k = L-1;  k>-1;k--)
        Piles[L+1][j++] = Piles[L][k];
      //now flip cards from L back to 1
      for (int k = 1;  k<=L;k++)
        UpDown[k] *=   -1;
      L++;
    }
  }
  //at this point L+1 == R, we make the last flip
  // pile R has n-R+1 cards, pile L has L cards
  cin>>f;
  if(f=='R'){   // pile at R gets flipped onto pile at L (== R-1)
    j = L;     //1st open spot on top of pile L
    for(int  k=n-R; k>-1;k--)
      Piles[L][j++] = Piles[R][k];
    // now flip the cards  on  pile  R
    for(int  k=R; k<=n;k++)
      UpDown[k] *=  -1;
    R--;        //now R = L 
  }
  else {  // flip pile L  onto pile  at R (== L+1)
    j = n-R+1;    //1st oopen spot on pile R
    for(int k=L-1; k>-1;k--)
      Piles[R][j++] = Piles [L][k];
    //flip cards on pile L
    for(int k=1;k<=L;k++)
      UpDown[k] *=  -1;
    L++;
  }
  // we should have one pile now at position L (== R)
}

// process querries - print results
void DoQueries(){
   int m, i, pos;

   cin>>m;
   for(int k=0;k<m;k++){
     cin>>i;
     pos = n-i;
     cout<<"Card "<<i<<" is a face";
     if(UpDown[Piles[L][pos]]==1)
       cout<<" up ";
     else
       cout<<" down ";
     cout<<Piles[L][pos]<<'.'<<endl;
   }
}

int main(){
  int CaseNo=1;
  cin>> n;
  while(n>0){
    InitPiles();
    DoFlips();

    cout<<"Pile "<<CaseNo++<<endl;
    DoQueries();

    cin>>n;
  }
 
  return 0;
}