#include <bits/stdc++.h>
using namespace std;
int n, m, S[25], F[1 << 22], Pr[1 << 22], Do[1 << 22], Tm[25];
vector<int> Ans;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    S[a] |= (1 << b);
    S[b] |= (1 << a);
  }
  for (int i = 0; i < n; i++) S[i] |= (1 << i);
  memset(F, 63, sizeof F);
  for (int i = 0; i < n; i++) F[1 << i] = 0;
  for (int i = 1; i < (1 << n); i++)
    for (int j = 0; j < n; j++)
      if ((i >> j) & 1)
        if (F[S[j] | i] > F[i] + 1) {
          F[S[j] | i] = F[i] + 1;
          Pr[S[j] | i] = i;
          Do[S[j] | i] = j;
        }
  int ans = 123, v;
  for (int i = 0; i < (1 << n); i++) {
    bool flag = 1;
    for (int j = 0; j < n; j++)
      if ((S[j] | i) != (1 << n) - 1) {
        flag = 0;
        break;
      }
    if (flag && F[i] < ans) {
      ans = F[i];
      v = i;
    }
  }
  printf("%d\n", F[v]);
  for (int i = v; i; i = Pr[i]) Ans.push_back(Do[i] + 1);
  for (int i = (int)Ans.size() - 2; i != -1; i--) printf("%d ", Ans[i]);
  return 0;
}
