#include <iostream>
#include <string>

int konst;
int konstpows[100];

int hash(string s)
{ int h = 0;
  for (int i=0; i<s.length(); i+=1)
  { h *= konst;
    h += s[i]; }
  return h; }

void prep()
{ int p = 1;
  for (int i=0; i<100; i+=1)
  { konstpows[i] = p;
    p *= konst; } }

void pmatch(string s, int beg, int end, string wanted)
{ cout << "match? ";
  for (int i=0; i<s.length(); i+=1)
  { if (i==beg)
      cout << " [ ";
    cout << s[i];
    if (i==end)
      cout << " ] "; }
  if (s.substr(beg, end-beg+1)==wanted)
    cout << " YES\n";
  else
    cout << " no\n"; }

void main()
{ string big = "";
  konst = 97;
  prep();
  while (1)
  { string inp;
    getline(cin, inp);
    if (inp[0]=='b')
    { big = inp.substr(2);
      continue; }
    else if (inp[0]=='p')
    { konst = atol(inp.substr(2).c_str());
      prep();
      continue; }
    inp = inp.substr(2);
    int len = inp.length(), biglen = big.length();
    int searchhash = hash(inp);
    int currhash = hash(big.substr(0, len));
    for (int start=0, end=len-1; end<biglen; start+=1, end+=1)
    { if (searchhash==currhash)
        pmatch(big, start, end, inp);
      currhash-=konstpows[len-1]*big[start];
      currhash*=konst;
      currhash+=big[end+1]; }
    cout << "search over\n"; } }