#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int inf = numeric_limits<int>::max() / 2;
const long double eps = 1e-9;
const long double pi = acosl(-1);
template <typename T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, 1) : 0;
}
inline void solve(), read();
const string file = "";
signed main() {
  if (file != "") {
    freopen((file + ".in").c_str(), "r", stdin);
    freopen((file + ".out").c_str(), "w", stdout);
  }
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  read();
  solve();
  return 0;
}
const int MAXN = 22;
const int MAXT = 1ll << MAXN;
inline bool checkbit(int n, int p) { return n & (1ll << p); }
inline void setbit(int& n, int p) { n |= (1ll << p); }
int n, m;
int adj[MAXN];
int dp[MAXT];
pair<int, int> par[MAXT];
inline void solve() {
  if (m == n * (n - 1) / 2) {
    cout << 0 << "\n";
    return;
  }
  fill(dp, dp + (1ll << n), inf);
  dp[0] = 0;
  for (int i = 0; i < n; i++) {
    dp[adj[i]] = 1;
    par[adj[i]] = {-1, i};
  }
  for (int m = 0; m < (1ll << n); m++) {
    if (dp[m] >= inf) {
      continue;
    }
    for (int v = 0; v < n; v++) {
      if (!checkbit(m, v)) {
        continue;
      }
      if (mineq(dp[m | adj[v]], dp[m] + 1)) {
        par[m | adj[v]] = {m, v};
      }
    }
  }
  vector<int> ans;
  int v = (1ll << n) - 1;
  while (v != -1) {
    ans.push_back(par[v].second);
    v = par[v].first;
  }
  cout << (int)((ans).size()) << "\n";
  for (int v : ans) {
    cout << v + 1 << " ";
  }
  cout << "\n";
}
inline void read() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    setbit(adj[i], i);
  }
  for (int i = 0; i < m; i++) {
    int v, u;
    cin >> v >> u;
    --v, --u;
    setbit(adj[v], u);
    setbit(adj[u], v);
  }
}
