//  SP2003 Problem Grids.  
//
//  (inputfile as command-line argument)
//
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <assert.h>

using namespace std;

typedef vector<char> Tile;

string probname;
int numtiles;
vector<Tile> Tiles(80);
Tile Target(16);

int bestCnt;
vector<int> BestStack(11);
vector<int> CurStack(11);
vector<bool> used(10);

int tries=0;

void readtile(istream &in1, Tile &tile)
{
   char ch;
   for (int i=0; i<16; i++)
   {
     in1 >> ch;
     tile[i]=ch;
   }
}

void rotate(const Tile &t1, Tile &t2)
{
  char sq[4][4];
  int i, j, k;
  
  for( k = 0, i = 0; i <= 3; i++) 
    for( j = 0; j <= 3; j++) { sq[i][j] = t1[k]; k = k + 1; }
  for( k = 0, j = 0; j <= 3; j++) 
    for( i = 3; i >= 0; i--) { t2[k] = sq[i][j]; k = k + 1; }
}  

void flip(const Tile &t1, Tile &t2)
{
  char sq[4][4];
  int i, j, k;
  
  for( k = 0, i = 0; i <= 3; i++) 
    for( j = 0; j <= 3; j++) { sq[i][j] = t1[k]; k = k + 1; }
  for( k = 0, i = 3; i >= 0; i--) 
    for( j = 0; j <= 3; j++) { t2[k] = sq[i][j]; k = k + 1; }
}   

bool equal(const Tile &T1, const Tile &T2)
{
  for (int i=0; i<16; i++) if (T1[i]!=T2[i]) return false;
  return true;
}

void search(const Tile &Image, vector<int> &CurStack, int curCnt)
{
  if (tries > 200000) return; else tries++;  // cheating

  if (curCnt >= bestCnt) return;

#ifdef debug
cerr << "curCnt=" << curCnt << ':'; 
for (int h=0; h<curCnt; h++)  cerr << ' ' << CurStack[h]; cerr << endl;
cerr << "Image="; for (int g=0; g<16; g++) cerr << Image[g]; cerr << endl;
#endif

  if (equal(Image,Target))
  {
    bestCnt = curCnt; 
    for (int s=0; s<curCnt; s++) { BestStack[s] = CurStack[s]; }
    return; 
  }

  int t; 
  for (t = 0; t < 8*numtiles; t++) 
  {
    if (used[t/8]==true) continue;

#ifdef debug
cerr << "trying tile " << (t/8) << '/' << (t%8) << endl;
#endif

    bool improves = false;
    bool ruins = false;
    for (int i=0; i<16; i++)
    {
      if (Tiles[t][i]=='.' || Image[i] !='.') continue;
      if (Tiles[t][i]==Target[i]) improves=true; 
      else 		    	  ruins=true; 
    }

    if (improves==true && ruins==false)
    {
      Tile Image2(Image);
      for (int j=0; j<16; j++) 
      {
        if (Image2[j]=='.' && Tiles[t][j]==Target[j]) Image2[j]=Target[j];
      }
      CurStack[curCnt]=t;
      used[t/8]=true;
      search(Image2, CurStack, curCnt+1);
      used[t/8]=false;
    }
  }
}

int main(int argc, const char* argv[])
{
  if (argc!=2) { cerr << "usage: progname infile\n"; return 1; }
  
  ifstream in1(argv[1]);

  int i; for (i=0; i<80; i++) Tiles[i].resize(16);

  while (true)
  {
    in1 >> probname >> numtiles;    
    if (probname[0]=='#') return 0;
    cout << probname;

    assert((numtiles >= 1) && (numtiles <= 10));

    int t; for (t = 0; t <= numtiles-1; t++) 
    {
        int t8 = t*8; readtile(in1,Tiles[t8]);
        rotate(Tiles[t8+0], Tiles[t8+1]);	
        rotate(Tiles[t8+1], Tiles[t8+2]);	
        rotate(Tiles[t8+2], Tiles[t8+3]);
        rotate(Tiles[t8+3], Tiles[t8+4]);
        flip  (Tiles[t8+4], Tiles[t8+4]);
        rotate(Tiles[t8+4], Tiles[t8+5]);	
        rotate(Tiles[t8+5], Tiles[t8+6]);	
        rotate(Tiles[t8+6], Tiles[t8+7]);
     }  

    readtile(in1,Target);

    // Now search for answer

    bestCnt=11;
    fill(used.begin(),used.end(),false);
    Tile curImg(16);
    fill(curImg.begin(),curImg.end(),'.');
    vector<int> curStack(numtiles);

    tries=0;
    search(curImg, curStack, 0);

    if (bestCnt==11) { cout << " noway" << endl; continue; }

    for (i=0; i<bestCnt; i++) 
       cout << ' ' << (BestStack[i]/8) << '/' << (BestStack[i]%8); 
    cout << endl;

  } // next problem (while)

}