#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1010;

int n, m, deg[maxn];
bitset<maxn> e[maxn];
vector<int> ed[maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m;
  rep (i, 1, m) {
    int u, v;
    cin >> u >> v;
    deg[u]++, deg[v]++;
    e[u].set(v), e[v].set(u);
    ed[u].emplace_back(v);
    ed[v].emplace_back(u);
  }
  int qwq = 0;
  rep (i, 1, n) if (!deg[i]) qwq++;
  int cnt = 0;
  vector<int> d2;
  rep (i, 1, n) if (deg[i] == 2) d2.emplace_back(i);
  for (int a : d2) for (int b : d2) for (int c : d2) {
    if (a == b || a == c || b == c) continue;
    if (e[a].test(b) && e[b].test(c) && e[c].test(a)) cnt++;
  }
  if (cnt) return cout << "ok\n", 0;
  cout << "mark\n";
  vector<int> p(0);
  rep (i, 1, n) p.emplace_back(i);
  sort(ALL(p), [&](int x, int y) { return deg[x] < deg[y]; });
  int a = p[0], b = p[1], c = p[2];
  map<pii, int> mp;
  for (int w : ed[a]) mp[minmax(w, a)] ^= 1;
  for (int w : ed[b]) mp[minmax(w, b)] ^= 1;
  for (int w : ed[c]) mp[minmax(w, c)] ^= 1;
  mp[minmax(a, b)] ^= 1, mp[minmax(b, c)] ^= 1;
  mp[minmax(c, a)] ^= 1;
  vector<pii> ans(0);
  for (auto [x, y] : mp) if (y) ans.emplace_back(x);
  cout << SZ(ans) << '\n';
  for (auto [x, y] : ans) cout << x << " " << y << '\n';
}