#include<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
const int maxn=1000+10;
int n,m,f[maxn][maxn],d[maxn],g[maxn][maxn],in[maxn];
mt19937_64 rd(time(0));
void solve(){
    cin>>n>>m;
    for(int i=1,u,v;i<=m;i++) cin>>u>>v,f[u][v]=f[v][u]=1,d[u]++,d[v]++;
    int max1=0,max2=0,maxi;
    for(int i=1;i<=n;i++){
        if(d[i]>max1) maxi=i,max1=d[i];
        else if(d[i]>max2) max2=d[i];
    }
    if(max2-max1>=5) return cout<<"ok"<<endl,void();
    cout<<"mark"<<endl<<5<<endl;
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(i==maxi||f[i][maxi]) continue;
        cout<<i<<" "<<maxi<<endl,cnt++;
        if(cnt==5) break;
    }
}
int main(){
//	freopen("graph.in","r",stdin);
//	freopen("graph.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/