#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 1000000007;
const double pi = acos(-1.0);
inline void gn(long long& x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int& x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long& x) {
  long long t;
  gn(t);
  x = t;
}
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long x, long long mod) {
  long long t = 1ll;
  while (x) {
    if (x & 1) t = t * a % mod;
    a = a * a % mod;
    x >>= 1;
  }
  return t;
}
const int maxn = 6e6;
vector<int> E[maxn];
int ans[33], now[33];
int mi;
bool know[23][23];
int vv[33];
int n, m;
bool need(int u) {
  int t = 0;
  for (int i = (1); i <= (n); i++)
    if (know[u][i]) vv[++t] = i;
  bool ret = false;
  for (int i = (1); i <= (t); i++)
    for (int j = (i + 1); j <= (t); j++)
      if (!know[vv[i]][vv[j]]) {
        ret = true;
        know[vv[i]][vv[j]] = know[vv[j]][vv[i]] = true;
      }
  return ret;
}
int main() {
  mi = inf;
  gn(n);
  gn(m);
  for (int i = (1); i <= (m); i++) {
    int a, b;
    gn(a);
    gn(b);
    E[a].push_back(b);
    E[b].push_back(a);
  }
  for (int i = (1); i <= (n); i++) now[i] = i;
  while (clock() < CLOCKS_PER_SEC * 0.8) {
    random_shuffle(now + 1, now + 1 + n);
    int nowstep = 0;
    memset((know), 0, sizeof(know));
    for (int i = (1); i <= (n); i++)
      for (auto x : E[i]) know[i][x] = true;
    for (int i = (1); i <= (n); i++)
      if (need(now[i])) nowstep++;
    if (nowstep < mi) {
      mi = nowstep;
      for (int i = (1); i <= (n); i++) ans[i] = now[i];
    }
  }
  printf("%d\n", mi);
  memset((know), 0, sizeof(know));
  for (int i = (1); i <= (n); i++)
    for (auto x : E[i]) know[i][x] = true;
  for (int i = (1); i <= (n); i++)
    if (need(ans[i])) printf("%d ", ans[i]);
  puts("");
  return 0;
}
