#include <stdio.h>
#include <assert.h>

#define MaxNode 1048576
#define MaxBug 20
#define MaxPatch 100
#define oo 1000000000

FILE * input;

int pos[MaxPatch], neg[MaxPatch], fixed[MaxPatch],
    intro[MaxPatch], time[MaxPatch];
int pNum, bNum;

int queue[MaxNode], val[MaxNode], last;
int found[MaxNode];

int apply(int p, int s)
{
  int s1;
  s1 = (s & (~fixed[p])) | intro[p];
  /*  printf("applying %d to %d yields %d\n", p, s, s1); */
  return s1;
}

int applicable(int p, int s)
{
  int flag;
  flag = (((~s) & pos[p])==0) && ( (s & neg[p])==0);
  /* printf("%d %s applicable to %d\n", p, flag?"":"Not ", s); */
  return flag;
}

int search(int start)
{
  int p, best, best_at;
  int pVal[MaxPatch], next[MaxPatch];
  

  last = 1; queue[0] = start; val[0] = 0;

  for (p=0; p<start; p++) found[p] = 0;
  found[start]=1;

  for (p=0; p<pNum; p++) {
    pVal[p]=oo; next[p]=0;
  }

  while (1){
    best = oo; best_at = -1;
    for (p=0; p<pNum; p++){
      if (pVal[p]==oo)
	while (next[p]<last){
	  if (applicable(p, queue[next[p]])){
	    pVal[p] = val[next[p]]+time[p];
	    break;
	  }
	  next[p]++;
	}
      if (pVal[p]<best){
	best = pVal[p];
	best_at = p;
      }
    }
    if (best_at==-1) return -1;
    
    queue[last]=apply( best_at, queue[next[best_at]]);
    next[best_at]++;
    pVal[best_at]=oo;
    if (queue[last]==0) return best;
    val[last] = best;
    if (!found[queue[last]]) {
      found[queue[last]]=1;
      last++;
    }
  }
}

int readCase()
{
  char pre[30], post[30];
  int b, p;

  fscanf( input, " %d %d", &bNum, &pNum);

  if (pNum==0 && bNum==0) return 0;

  for (p=0; p<pNum; p++){
    fscanf( input, " %d %s %s", &time[p], pre, post);
    pos[p] = neg[p] = fixed[p] = intro[p] = 0;
    for (b = 0; b<bNum; b++){
      neg[p]<<=1;
      pos[p]<<=1;
      fixed[p]<<=1;
      intro[p]<<=1;

      if (pre[b]=='+') pos[p]++;
      else if (pre[b]=='-') neg[p]++;
      else assert(pre[b]=='0');

      if (post[b]=='+') intro[p]++;
      else if (post[b]=='-') fixed[p]++;
      else assert(post[b]=='0');

    }
  }

  return 1;
}


void solveCase( int kase)
{
  int v, b, start;
  for (start=0, b=0; b<bNum; b++) start=(start<<1)+1;

  v = search(start);

  printf("Product %d\n", kase);
  if (v==-1) printf("Bugs cannot be fixed.\n\n");
  else printf("Fastest sequence takes %d seconds.\n\n", v);

}

int main()
{
  int kase = 0;

  input = fopen( "bugs.in" , "r");
  assert( input != NULL);

  while (readCase()) solveCase(++kase);

  fclose(input);

  return 0;
}