#include <iostream>
#include <vector>
using namespace std;

void rotace(int *pole,int pocet,int vel)
{
 int *tmp=new int[vel];
 for (int i=0;i<vel;i++) tmp[i]=pole[i];
 for (int i=0;i<pocet;i++) pole[i]=tmp[pocet-i-1];
}

bool porov(int *pole1,int *pole2, int vel)
{
 bool out=true;
 for (int i=0;i<vel;i++) if (pole1[i]!=pole2[i])
 {
   out=false;
   break;
 }
 return out;
}

int find(int *pole,int cislo,int vel)
{
  for (int i=0;i<vel;i++) if (pole[i]==cislo) return i;
  return 0;
}

int main()
{
  int pocet;
  vector<int> outy;
  cin >> pocet;
  //cin.get();
  while (pocet)
  {
    int *poleA=new int[pocet];
    int *poleB=new int[pocet];
    
  for (int i=0;i<pocet;i++) cin >> poleA[i];
  for (int j=0;j<pocet;j++) cin >> poleB[j];
  //rotace(poleA,3,pocet);
  
  int i=pocet-1;
  
  while (i>0)
  {
   if (poleA[i]!=poleB[i]) 
   {
     int f=find(poleA,poleB[i],pocet);
     if (f!=0) 
     {
       rotace(poleA,f+1,pocet);
       outy.push_back(f+1);
     }
     rotace(poleA,i+1,pocet);
     outy.push_back(i+1);
     
  }
    i--;
  }
  
  for(int k = 0; k < outy.size() - 1; k++)
    cout << outy[k] << " ";
  cout << outy[outy.size()-1];
  cout << endl;
  delete [] poleA;
  delete [] poleB;
  //cout << "fdsa";  
  cin >> pocet;
  //cin.get();
  }
  
  
  return 0;
}