/*
 * Word Finder NZ01A (via Michael J. Dinneen)
 */
#include <iostream>
#include <string>

using namespace std;

void printfound(string str, int sr, int sc, int lr, int lc)
{
  cout << str << " found from (" << sr+1 << ',' << sc+1 << ") to (" <<
                                    lr+1 << ',' << lc+1 << ").\n"; 
}

int main(int argc, char *argv[])
{
  char grid[100][100];
  int cnt=0;
  int r, c;

  while (true)
  {
    cin >> r >> c;
    if (r==0 && c==0) break;

    if (cnt) cout << endl;  // blank line between grids
    cout << "Grid " << (++cnt) << endl;
 
    string row;
    for (int i=0; i<r; i++)  // read grid
    {
      cin >> row;
      for (int j=0; j<c; j++) grid[i][j]=row[j];
    }

    string str;
    while (true)
    {
nextword:
       cin >> str;
       if (str[0]=='#') break; 
 
       int len = str.length(), lm1=len-1;
       for (int sr=0; sr<r; sr++)
       for (int sc=0; sc<c; sc++)
       {
          if (sc+lm1 < c)
          for (int i=0; i<len; i++) // horizontal right
          {  
             if (grid[sr][sc+i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr,sc+lm1); goto nextword; }
          }

          if (sc-lm1 >= 0)
          for (int i=0; i<len; i++) // horizontal left
          {
             if (grid[sr][sc-i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr,sc-lm1); goto nextword; }
          }

          if (sr+lm1 < r)
          for (int i=0; i<len; i++) // vertical down
          {
             if (grid[sr+i][sc] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr+lm1,sc); goto nextword; }
          }

          if (sr-lm1 >= 0)
          for (int i=0; i<len; i++) // vertical up
          {
             if (grid[sr-i][sc] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr-lm1,sc); goto nextword; }
          }

          if (sc+lm1 < c && sr+lm1 < r)
          for (int i=0; i<len; i++) // right + down
          {  
             if (grid[sr+i][sc+i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr+lm1,sc+lm1); goto nextword; }
          }

          if (sc-lm1 >= 0 && sr+lm1 < r)
          for (int i=0; i<len; i++) // left + down
          {
             if (grid[sr+i][sc-i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr+lm1,sc-lm1); goto nextword; }
          }

          if (sc+lm1 < c && sr-lm1 >= 0)
          for (int i=0; i<len; i++) // right + up
          {
             if (grid[sr-i][sc+i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr-lm1,sc+lm1); goto nextword; }
          }

          if (sr-lm1 >= 0 && sc-lm1 >= 0)
          for (int i=0; i<len; i++) // left + up
          {
             if (grid[sr-i][sc-i] != str[i]) break;
             if (i==lm1) { printfound(str,sr,sc,sr-lm1,sc-lm1); goto nextword; }
          }

       }

       cout << str << " not found.\n";
       
    } // next search word
     
  } // next sequence of puzzles
        
}