/* Kristoffer Hansen. arnsfelt@daimi.au.dk */

#include <iostream>
#include <string>

const int MAXN = 101;

int G[MAXN][MAXN];
int W[MAXN][MAXN];

int n,m;

int main()
{
  int i,j,k,w,t;
  string op;

  while (cin >> n && n>0) {
    n++;
    cin >> m;

    for (i=0; i<n; i++)
      for (j=0; j<n; j++)
	G[i][j]=W[i][j]=0;

    for (k=0; k<m; k++) {
      cin >> i >> j >> op >> w;
      i--;
      j = i+j+1;
      if (op=="gt") {
	t = i;
	i = j;
	j = t;
	w = -w;
      }
      w--;
      if (G[i][j]==0 || w<W[i][j]) {
	G[i][j]=1;
	W[i][j]=w;
      }
    }

    for (k=0; k<n; k++)
      for (i=0; i<n; i++)
	for (j=0; j<n; j++) {
	  if (G[i][k]==1 && G[k][j]==1) {
	    if (G[i][j]==0 || W[i][k]+W[k][j]<W[i][j]) {
	      G[i][j]=1;
	      W[i][j] = W[i][k]+W[k][j];
	    }
	  }
	}
    for (i=0; i<n && (G[i][i]==0 || W[i][i]>=0); i++) ;
    if (i==n)
      cout << "lamentable kingdom\n";
    else
      cout << "successful conspiracy\n";
  }
  return 0;
}