#include<bits/stdc++.h>

using namespace std;

const int maxm = ;

const int maxn = ;

int pre[maxm][],nxt[maxm][];

int cost[maxm];

int n,m;

int dist[<<maxn];

typedef pair<int,int> Node;

#define fi first

#define se second

//bitset<20> temp;

#define bug(u)\

temp = u; cout<<#u<<'='<<temp<<endl;

#define cer(x)\

cout<<"dist="<<x<<endl;

const int INF = 0x3f3f3f3f;

void dijkstra()

{

    priority_queue<Node,vector<Node>,greater<Node> > q;

    memset(dist,0x3f,sizeof(int)*(<<n));

    q.push(Node(,(<<n)-));

    dist[(<<n)-] = ;

    while(q.size()){

        Node x = q.top(); q.pop();

        if(x.se == )  { printf("Fastest sequence takes %d seconds.\n",dist[]); return; }

        if(x.fi != dist[x.se]) continue;

        int u = x.se;

        for(int i = ; i < m; i++){

            if( (pre[i][]&u) == u && (pre[i][]|u) == u){

                int v = (u&nxt[i][])|nxt[i][];

                if(dist[v] > dist[u]+cost[i]){

                    dist[v] = dist[u] + cost[i];

                    q.push(Node(dist[v],v));

                }

            }

        }

    }

    puts("Bugs cannot be fixed.");

}

int main()

{

    //freopen("in.txt","r",stdin);

    int kas = ;

    char s1[maxn+],s2[maxn+];

    while(scanf("%d%d",&n,&m),n){

        for(int i = ; i < m ; i++){

            scanf("%d%s%s",cost+i,s1,s2);

            nxt[i][] = nxt[i][] = pre[i][] = pre[i][] = ;

            for(int j = ; j < n; j++){

                if(s1[j] == '+') pre[i][] |= <<j;

                if(s1[j] != '-') pre[i][] |= <<j;

                if(s2[j] == '+') nxt[i][] |= <<j;

                if(s2[j] != '-') nxt[i][] |= <<j;

            }

        }

        printf("Product %d\n",++kas);

        dijkstra();

        putchar('\n');

    }

    return ;

}