/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define RFOR(i, n) for(int i = n-1; i >= 0; --i)
#define output_vec(vec) { FOR(i_, sz(vec)) cout << vec[i_] << ' '; cout << '\n'; }
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<bool> vb;
typedef short si;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

int n, m;
vector<vector<int>> a;

bool check(int mask)
{
    //int n = sz(a);
    //int m = sz(a[0]);
    vector<int> v(m, -1);
    FOR (i, m)
    {
        if (mask & 1 << i)
            v[i] = 1;
    }
    FOR (i, n)
    {
        bool ok = false;
        FOR (j, m)
        {
            auto it1 = find(all(a[i]), (j + 1));
            auto it2 = find(all(a[i]), -(j + 1));
            if (it1 == a[i].end() && it2 == a[i].end())
                continue;
            if (it1 != a[i].end() && it2 != a[i].end())
                {
                    ok = true;
                    break;
                }
            
            if (it1 != a[i].end())
            {
                if (v[j] == 1)
                {
                    ok = true;
                    break;
                }
            }
            else
            {
                if (v[j] == -1)
                {
                    ok = true;
                    break;
                }
            }
        }
        if (!ok)
            return false;
    }
    return true;
}

int solve()
{
    //int n, m;
    if (!(cin >> n >> m))
        return 1;
    
    
    
    a.clear();    
    a.resize(n, vector<int>(3));
    FOR (i, n)
        FOR (j, 3)
            cin >> a[i][j];
            
    if (n >= 8)
        cout << "satisfactory\n";
    else
        cout << "unsatisfactory\n";
    return 0;
            
    for (int i = 0; i < 1 << m; i++)
    {
        if (check(i))
        {
            cout << i << '\n';
            cout << "satisfactory\n";
            return 0;
        }
    }
    cout << "unsatisfactory\n";
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}