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


// 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>* nums1 = &adj[x];
    set<int>* nums2 = &pos.back();
    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);
            i ++;
            j ++;
        }else if (*i > *j){
            j ++;
        }else {
            i ++;
        }
    }
    pos.push_back(next);
    for (int v: next){
        if (dfs(v, d+1)) return 1;
    }
    pos.pop_back();
    return 0;
}

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);
    }
    for (int x = 0; x < n; x ++){
        pos.push_back(adj[x]);
        if (dfs(x)){
            cout << "ok" << endl;
            return 0;
        }
        pos.pop_back();
    }
    for (int x = 0; x < n; x ++){
        for (int y = x+1; y < n; y ++){
            // cout << x << " " << y << endl;
            if (adj[x].find(y) == adj[x].end()){
                continue;
            }
            // cout << "HI" << endl;
            set<int> nums;
            set<int> inter;
            set<int>* nums1 = &adj[x];
            set<int>* nums2 = &adj[y];
            auto i = nums1->begin();
            auto j = nums2->begin();
            // cout << "HI" << endl;
            while (i != nums1->end() || j != nums2->end()){
                // cout << (i != nums1->end()) << (j != nums2->end()) << " ";
                // cout << *i << " " << *j << " " << nums1->end() << " " << nums2->end() << endl;
                if (i == nums1->end()){
                    // cout << 1 << endl;
                    nums.insert(nums.end(), *j);
                    j ++;
                }else if (j == nums2->end()){
                    // cout << 2 << endl;
                    nums.insert(nums.end(), *i);
                    i ++;
                }else if (*i > *j){
                    // cout << 1 << endl;
                    nums.insert(nums.end(), *j);
                    j ++;
                }else if (*i < *j){
                    // cout << 2 << endl;
                    nums.insert(nums.end(), *i);
                    i ++;
                }else {
                    // cout << 3 << endl;
                    nums.insert(nums.end(), *j);
                    inter.insert(inter.end(), *i);
                    i ++;
                    j ++;
                }
            }
            nums.erase(x);
            nums.erase(y);
            // cout << "HI" << endl;
            if (inter.empty()){
                continue;
            }
            if (nums.size()-1 < 2){
                continue;
            }
            vector<pair<int, int>> change;
            int a = *inter.begin();
            nums.erase(a);
            int b = *nums.begin();
            int c = *nums.rbegin();
            vector<int> test = {x, y, a, b, c};
            for (int x = 0; x < 5; x ++){
                for (int y = x+1; y < 5; y ++){
                    if (adj[test[x]].find(test[y]) == adj[test[x]].end()){
                        change.push_back({test[x], test[y]});
                    }
                }
            }
            cout << "mark" << endl;
            cout << change.size() << endl;
            for (pair<int, int> p: change){
                cout << p.first << " " << p.second << endl;
            }
            return 0;
        }
    }
    // cout << "ok" << endl;
}