#include <bits/stdc++.h>
using namespace std;
int i, n, x, y, a[100000];
int f[100], Mp[100], p[100][100];
int sum, ans, m;
int find(int i) {
  if (f[i] != i) f[i] = find(f[i]);
  return f[i];
}
void Dfs(int now, int x, int y) {
  if (sum <= y) return;
  if (x == n) {
    bool flag = 1;
    int F = -1;
    for (i = 0; i < n; i++) {
      if (now & (1 << i)) {
        if (F == -1)
          F = find(i);
        else if (F != find(i)) {
          flag = 0;
          break;
        }
      } else if ((Mp[i] & now) == 0) {
        flag = 0;
        break;
      }
    }
    if (flag) {
      sum = y;
      ans = now;
    }
  } else {
    for (i = 0; i < n; i++) p[x][i] = f[i];
    int now1 = find(x);
    for (i = 0; i < n; i++)
      if ((Mp[x] & (1 << i) & now)) f[find(i)] = now1;
    Dfs(now | (1 << x), x + 1, y + 1);
    for (i = 0; i < n; i++) f[i] = p[x][i];
    Dfs(now, x + 1, y);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  if (n * (n - 1) == m * 2) {
    printf("0\n");
    return 0;
  }
  for (i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    x--;
    y--;
    Mp[x] |= (1 << y);
    Mp[y] |= (1 << x);
  }
  for (i = 0; i < n; i++) {
    Mp[i] |= (1 << i);
    f[i] = i;
  }
  sum = 100000;
  Dfs(0, 0, 0);
  printf("%d\n", sum);
  for (i = 0; i < n; i++)
    if (ans & (1 << i)) {
      printf("%d ", i + 1);
    }
  return 0;
}
