#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
inline T range(T l, T r) {
  return uniform_int_distribution<T>(l, r)(rng);
}
template <typename T>
void Min(T &a, T b) {
  a = min(a, b);
}
template <typename T>
void Max(T &a, T b) {
  a = max(a, b);
}
template <typename T>
ostream &operator<<(ostream &cout, vector<T> x) {
  for (auto it = x.begin(); it != x.end(); ++it) {
    if (it == x.begin())
      cout << "{" << *it;
    else
      cout << ", " << *it;
  }
  cout << "}";
  return cout;
}
template <typename T>
ostream &operator<<(ostream &cout, set<T> x) {
  for (auto it = x.begin(); it != x.end(); ++it) {
    if (it == x.begin())
      cout << "{" << *it;
    else
      cout << ", " << *it;
  }
  cout << "}";
  return cout;
}
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 22;
int n, m;
int dp[1 << N];
int g[N];
pair<int, int> back[1 << N];
vector<int> ans;
int main() {
  memset(dp, 0x3f, sizeof(dp));
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    g[u] |= 1 << v;
    g[v] |= 1 << u;
  }
  for (int i = 0; i < n; ++i) g[i] |= 1 << i;
  for (int mask = 0; mask < (1 << n); ++mask) {
    int mutual_mask = (1 << n) - 1;
    for (int i = 0; i < n; ++i) {
      if (1 << i & mask) mutual_mask &= g[i];
    }
    if (mutual_mask == mask) dp[mask] = 0, back[mask] = {-1, 0};
  }
  for (int mask = 0; mask < (1 << n); ++mask) {
    for (int i = 0; i < n; ++i) {
      if ((1 << i & mask) && dp[mask | g[i]] > dp[mask] + 1) {
        back[mask | g[i]] = {i, mask};
        dp[mask | g[i]] = dp[mask] + 1;
      }
    }
  }
  int mask = (1 << n) - 1;
  while (dp[mask]) {
    ans.push_back(back[mask].first + 1);
    mask = back[mask].second;
  }
  reverse(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (int i : ans) cout << i << ' ';
  cout << '\n';
  return 0;
}
