//============================================================================
// Name : POJ_1364.cpp
// Author : tiger
// Version :
// Copyright : Your copyright notice
// Description : 破题!!!题意都搞不明白!!!
//============================================================================
#include <iostream>
#include <stdio.h>
using namespace std;
struct edge
{
int from, to;
int value;
};
edge mat[101];
int dist[101];
#define inf 100000000;
bool bellman(int n, int m, int s)
{
int i, j;
for (i = 0; i < n; i++)
{
dist[i] = inf;
}
dist[s] = 0;
bool f = false;
for (i = 0; i < n - 1; i++)
{
f = false;
for (j = 0; j < m; j++)
{
if (dist[mat[j].from] < dist[mat[j].to] - mat[j].value)
{
dist[mat[j].to] = dist[mat[j].from] + mat[j].value;
f = true;
}
}
if (!f)
return true;
}
for (j = 0; j < m; j++)
{
if (dist[mat[j].from] < dist[mat[j].to] - mat[j].value)
{
return false;
}
}
return true;
}
int main()
{
freopen("in", "r", stdin);
int n, m, i, si, ni, ki;
char oi[4];
while (scanf("%d %d", &n, &m) && n)
{
for (i = 0; i < m; i++)
{
scanf("%d %d %s %d", &si, &ni, oi, &ki);
if (oi[0] == 'g')
{
ki++;
mat[i].from = si + ni;
mat[i].to = si - 1;
mat[i].value = -ki;
}
else
{
ki--;
mat[i].to = si + ni;
mat[i].from = si - 1;
mat[i].value = ki;
}
}
if(bellman(n+1,m,0))
printf("lamentable kingdom/n");
else
printf("successful conspiracy/n");
}
return 0;
}