#include<bits/stdc++.h>
using namespace std;
#define int long long
// char buf[1<<22],*p1,*p2;
// #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<22,stdin),p1==p2)?0:*p1++)
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch))f=(ch=='-')?-1:1,ch=getchar();
    while(isdigit(ch))x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return x*f;
}
const int N=5005;
int n,m,g[N][N];
int pu[N],pv[N],vis[N][N];
signed main(){
    // mt19937 rnd(998244353);
    // mt19937 rnd(19260817);
    n=read();m=read();
    for(int i=1;i<=m;i++){
        int u=read(),v=read();
        g[u][v]=g[v][u]=1;
    }
    pu[1]=835;pv[1]=188;
    pu[2]=104;pv[2]=781;
    pu[3]=216;pv[3]=778;
    pu[4]=678;pv[4]=958;
    pu[5]=301;pv[5]=87;
    int flg=1;
    for(int i=1;i<=5;i++)flg&=g[pu[i]][pv[i]];
    if(flg){puts("ok");return 0;}
    puts("mark");
    int cnt=0;
    for(int i=1;i<=5;i++)if(!g[pu[i]][pv[i]])++cnt;
    printf("%lld\n",cnt);
    for(int i=1;i<=5;i++)if(!g[pu[i]][pv[i]])printf("%lld %lld\n",pu[i],pv[i]);
    return 0;
}