#include <bits/stdc++.h>
using namespace std;

#define nums1 adj[x]
#define nums2 pos.back()

// mark graph in O(n^2+mn)

// check graph
    // dfs

const int N = 1000;

vector<set<int>> pos; 
set<int> adj[N];

bool dfs(int x, int d = 1){
    if (d == 5){
        return 1;
    }
    // set<int>* nums = &adj[i];
    set<int> next;
    auto i = nums1.begin();
    auto j = nums2.begin();
    while (i != nums1.end() && j != nums2.end()){
        if (*i == *j){
            next.insert(next.end(), *i);
        }else if (*i > *j){
            j ++;
        }else {
            i ++;
        }
    }
    pos.push_back(next);
    for (int v: next){
        if (dfs(v, d+1)) return 1;
    }
    return 0;
}

pair<int, int> edgeCheck[5] = {
{235, 156}, 
{166, 91}, 
{538, 650}, 
{987, 679}, 
{373, 792}};

set<pair<int, int>> edges;

int main(){
    int n, m;
    cin >> n >> m;
    for (int x = 0; x < m; x ++){
        int a, b;
        cin >> a >> b;
        a --, b --;
        adj[a].insert(b);
        adj[b].insert(a);
        edges.insert({a, b});
        edges.insert({b, a});
    }
    vector<pair<int, int>> change;
    for (int x = 0; x < 5; x ++){
        if (edges.find(edgeCheck[x]) == edges.end()){
            change.push_back(edgeCheck[x]);
        }
    }
    if (change.empty()){
        cout << "ok" << endl;
    }else {
        cout << "mark" << endl;
        for (pair<int, int> x: change){
            cout << x.first+1 << " " << x.second+1 << endl;
        }
    }
}