#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)
#define all(x) begin(x), end(x)
template <typename T>
bool chmax(T& a, const T& b) {
    return a < b ? (a = b, 1) : 0;
}
template <typename T>
bool chmin(T& a, const T& b) {
    return a > b ? (a = b, 1) : 0;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> edges(m);
    vector<vector<bool>> connected(n, vector<bool>(n));
    rep(i, 0, m) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        edges[i] = {u, v};
        connected[u][v] = connected[v][u] = true;
    }
    for (auto& e : edges) {
        for (auto& f : edges) {
            if (e.first == f.first || e.second == f.first ||
                e.first == f.second || e.second == f.second) {
                continue;
            }
            vector<int> vs = {e.first, e.second, f.first, f.second};
            bool ok = true;
            for (int u : vs) {
                for (int v : vs) {
                    if (u < v) {
                        ok &= connected[u][v];
                    }
                }
            }
            if (ok) {
                cout << "ok" << endl;
                return 0;
            }
        }
    }
    set<int> st;
    auto [u, v] = edges[0];
    st.insert(u);
    st.insert(v);
    for (int i = 0; st.size() < 4; ++i) {
        if (!st.count(i)) {
            st.insert(i);
        }
    }
    vector<pair<int, int>> add;
    for (int u : st) {
        for (int v : st) {
            if (u < v && !connected[u][v]) {
                add.push_back({u, v});
            }
        }
    }
    cout << "mark" << endl;
    cout << add.size() << endl;
    for (auto [u, v] : add) {
        ++u, ++v;
        cout << u << " " << v << endl;
    }
}