#include <bits/stdc++.h>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, M;
std::cin >> N >> M;
vector<vector<int>> graph(N);
for (int i = 0; i < M; ++i) {
int a, b;
std::cin >> a >> b;
a -= 1, b -= 1;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<int> adj(1 << N);
for (int set = 0; set < (1 << N); ++set) {
for (int i = 0; i < N; ++i) {
if (set >> i & 1) {
for (const int j : graph[i]) {
adj[set] |= 1 << j;
}
}
}
}
vector<vector<pair<int, int>>> transit(1 << N);
for (int set = 0; set < (1 << N); ++set) {
for (int i = 0; i < N; ++i) {
transit[adj[set] & ~(1 << i)].emplace_back(set, i);
}
}
vector<int> dist(1 << N, -1), last(1 << N, -1);
std::queue<int> que;
const auto push = [&](const int u, const int d, const int l) {
if (dist[u] == -1) {
dist[u] = d;
last[u] = l;
que.push(u);
}
};
push(0, 0, -1);
while (!que.empty()) {
const int u = que.front();
que.pop();
for (const auto& [v, i] : transit[u]) {
push(v, dist[u] + 1, i);
}
}
int set = (1 << N) - 1;
if (dist[set] == -1) {
std::cout << "NO\n";
return 0;
}
std::cout << "YES\n";
std::cout << dist[set] << '\n';
while (set != 0) {
std::cout << last[set] + 1;
set = adj[set] & ~(1 << last[set]);
std::cout << " \n"[set == 0];
}
return 0;
}
