#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

void solve(){
    int N,M;
    cin>>N>>M;
    vector<vector<int>> G(N,vector<int>(N));
    int cou=0;
    rep(i,0,N) rep(j,i+1,N){
        G[i][j]=cou;
        cou++;
    }
    int L=(1<<16);
    vector<int> p(10);
    rep(i,0,M){
        int a,b;
        cin>>a>>b;
        a--,b--;
        if(a>b) swap(a,b);
        p[G[a][b]/L]^=(G[a][b]%L);
    }
    bool ok=1;
    rep(i,0,5) if(p[i]) ok=0;
    if(ok){
        cout<<"ok\n";
        return;
    }
    cout<<"mark\n5\n";
    rep(i,0,5){
        rep(j,0,N) rep(k,j+1,N){
            if(G[j][k]==p[i]+L*i){
                cout<<j+1<<" "<<k+1<<"\n";
            }
        }
    }
}

int main(){
    solve();
}