/*
   1991 ACM Finals, Problem F, Message Decoding
   Ed Karrels, Oct. 1996
*/

#include <stdio.h>

int Bit() {
   char c;
   scanf(" %c", &c);
   return c-'0';
}

int Len() {
   int len;

   len = 4*Bit();
   len += 2*Bit();
   len += Bit();

   return len;
}

int Code(int len) {
   int val=0, i, pow2=2, base=0;

      /* read in the bits */
   for (i=0; i<len; i++) {
      val = val*2 + Bit();
   }
      /* val now contains the decimal representation of the bit code */
      /* now figure out that code's place int the sequence */
   for (i=0; i<len-1; i++) {
      base += pow2-1;
      pow2 *= 2;
   }

      /* if val is all 1's ( (2^n)-1 ), end here, return -1 */
   if (val == pow2-1) {
      return -1;
   } else {
      return val + base;
   }
}
   

int main() {
   char header[300];
   int len;
   int code;

   while (scanf(" "), 1==scanf("%[^\n]", header)) {
      while (len = Len(), len) {
	 while (code = Code(len), code != -1) {
	    putchar(header[code]);
	 }
      }
      putchar('\n');
   }

   return 0;
}