#include <bits/stdc++.h>
using namespace std;
const long double pi = 4.0 * atanl(1.0);
const long long mod = powl(10, 9) + 7;
string toBin(int n) {
  string ans = "";
  while (n) {
    if (n % 2 == 0)
      ans += '0';
    else
      ans += '1';
    n /= 2;
  }
  reverse((ans).begin(), (ans).end());
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  if (m == n * (n - 1) / 2) {
    cout << "0\n";
    return 0;
  }
  vector<vector<int>> adj(n);
  int a, b;
  for (int i = 0; i < (int)(m); ++i) {
    cin >> a >> b;
    a--, b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  vector<int> adjMask(n);
  for (int i = 0; i < (int)(n); ++i) {
    int mask = (1 << i);
    for (int x : adj[i]) mask |= (1 << x);
    adjMask[i] = mask;
  }
  vector<bool> isConnected(1 << n, false);
  for (int i = 0; i < (int)(n); ++i) isConnected[1 << i] = true;
  for (int mask = 0; mask < (int)(1 << n); ++mask) {
    if (isConnected[mask]) {
      int friendMask = mask;
      for (int i = 0; i < (int)(n); ++i) {
        if ((mask & (1 << i)) > 0) {
          friendMask |= adjMask[i];
        }
      }
      for (int i = 0; i < (int)(n); ++i) {
        if ((friendMask & (1 << i)) > 0) {
          isConnected[mask | (1 << i)] = true;
        }
      }
    }
  }
  vector<int> nodes(100, 0);
  for (int mask = 0; mask < (int)(1 << n); ++mask) {
    int friendMask = mask;
    for (int i = 0; i < (int)(n); ++i) {
      if ((mask & (1 << i)) > 0) {
        friendMask |= adjMask[i];
      }
    }
    if (isConnected[mask] && friendMask == (1 << n) - 1) {
      if (__builtin_popcount(mask) < nodes.size()) {
        nodes.clear();
        for (int i = 0; i < (int)(n); ++i) {
          if ((mask & (1 << i)) > 0) {
            nodes.push_back(i);
          }
        }
      }
    }
  }
  cout << nodes.size() << '\n';
  for (int x : nodes) cout << x + 1 << ' ';
  cout << '\n';
  return 0;
}
