#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
using namespace std;
using ld = long double;
using lli = long long;
using ii = pair<int, int>;
using vi = vector<int>;
const int N = 25;
int graph[N];
int mem[1 << 22];
int n, m;
template <class T>
void umin(T &a, T b) {
  a = min(a, b);
}
int dp(int mask) {
  if (__builtin_popcount(mask) == n) return 0;
  int &ans = mem[mask];
  if (ans == -1) {
    ans = 1e9;
    for (auto u = (0) - ((0) > (n)); u != (n) - ((0) > (n));
         u += 1 - 2 * ((0) > (n)))
      if ((mask >> u) & 1) {
        umin(ans, dp(mask | graph[u]) + 1);
      }
  }
  return ans;
}
void solve(int mask, vi &guests) {
  if (__builtin_popcount(mask) == n) return;
  int &ans = mem[mask];
  for (auto u = (0) - ((0) > (n)); u != (n) - ((0) > (n));
       u += 1 - 2 * ((0) > (n)))
    if ((mask >> u) & 1) {
      umin(ans, dp(mask | graph[u]) + 1);
      if (dp(mask | graph[u]) + 1 == ans) {
        guests.push_back(u);
        solve(mask | graph[u], guests);
        return;
      }
    }
}
int main() {
  cin.tie(0)->sync_with_stdio(0), cout.tie(0);
  while (cin >> n >> m) {
    for (auto u = (0) - ((0) > (n)); u != (n) - ((0) > (n));
         u += 1 - 2 * ((0) > (n)))
      graph[u] = 0;
    for (auto i = (0) - ((0) > (m)); i != (m) - ((0) > (m));
         i += 1 - 2 * ((0) > (m))) {
      int u, v;
      cin >> u >> v;
      --u, --v;
      graph[u] |= (1 << v);
      graph[u] |= (1 << u);
      graph[v] |= (1 << u);
      graph[v] |= (1 << v);
    }
    if (m * 2 == n * (n - 1)) {
      cout << "0\n";
      continue;
    }
    memset(mem, -1, sizeof(mem));
    int best = 0;
    for (auto u = (0) - ((0) > (n)); u != (n) - ((0) > (n));
         u += 1 - 2 * ((0) > (n)))
      if (dp(graph[u]) < dp(graph[best])) best = u;
    cout << dp(graph[best]) + 1 << '\n';
    vi guests = {best};
    solve(graph[best], guests);
    for (int i : guests) cout << i + 1 << " ";
    cout << '\n';
  }
  return 0;
}
