#include <bits/stdc++.h>
using namespace std;
int n, m;
int adj[5000005], can[5000005], fuck[5000005];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') f = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  return x * f;
}
int main() {
  n = read(), m = read();
  if (n == 1) {
    puts("0");
    return 0;
  }
  for (int i = 0; i < n; i++) adj[i] = 1 << i;
  while (m--) {
    int x = read() - 1, y = read() - 1;
    adj[x] |= 1 << y, adj[y] |= 1 << x;
  }
  int all = (1 << n) - 1;
  bool flag = 1;
  for (int i = 0; i < n; i++)
    if (adj[i] != all) flag = 0;
  if (flag) {
    puts("0");
    return 0;
  }
  for (int i = 0; i < n; i++) can[1 << i] = 1, fuck[1 << i] = adj[i];
  for (int i = 1; i < (1 << n); i++)
    if (can[i]) {
      for (int j = 0; j < n; j++)
        if ((~i >> j & 1) && (fuck[i] >> j & 1))
          can[1 << j | i] = 1, fuck[1 << j | i] = fuck[i] | adj[j];
    }
  int ans = n, mask = 0;
  for (int i = 1; i < (1 << n); i++)
    if (can[i] && (fuck[i] == all)) {
      int res = __builtin_popcount(i);
      if (ans > res) ans = res, mask = i;
    }
  printf("%d\n", ans);
  for (int i = 0; i < n; i++)
    if (mask >> i & 1) printf("%d ", i + 1);
  puts("");
  return 0;
}
