#include <bits/stdc++.h>
const int maxn = 200005;
using namespace std;
vector<int> path;
int h[maxn], par[maxn], high[maxn], highO[maxn], highD[maxn];
vector<int> v[maxn];
bool mark[maxn];
void go(int x, int y, bool f = true) {
  bool rev = (h[x] < h[y]);
  if (h[x] < h[y]) swap(x, y);
  vector<int> add;
  while (x != y) {
    add.push_back(x);
    x = par[x];
  }
  add.push_back(y);
  if (rev) reverse(add.begin(), add.end());
  for (int i = 0; i < add.size(); i++) path.push_back(add[i]);
  if (f) {
    cout << path.size() << ' ';
    for (int u : path) cout << u + 1 << ' ';
    cout << endl;
    path.clear();
  }
}
bool dfs(int cur) {
  mark[cur] = true;
  int U[2], O[2], D[2], id = 0, iu = 0;
  high[cur] = h[cur], highO[cur] = cur, highD[cur] = cur;
  for (int u : v[cur]) {
    if (!mark[u]) {
      h[u] = h[cur] + 1;
      par[u] = cur;
      if (dfs(u)) return true;
      if (high[u] < high[cur])
        high[cur] = high[u], highO[cur] = highO[u], highD[cur] = highD[u];
      if (high[u] < h[cur] && id < 2) {
        O[id] = highO[u];
        D[id++] = highD[u];
      }
    } else {
      if (h[u] > h[cur]) continue;
      if (h[u] < high[cur]) high[cur] = h[u], highO[cur] = cur, highD[cur] = u;
      if (h[u] < h[cur] - 1 && iu < 2) U[iu++] = u;
    }
  }
  if (iu == 2) {
    cout << "YES" << endl;
    int x = U[0], y = U[1];
    if (h[x] > h[y]) swap(x, y);
    go(cur, y);
    path.push_back(cur);
    go(x, y);
    path.push_back(cur);
    go(y, y);
  } else if (id == 2) {
    cout << "YES" << endl;
    int x = D[0], y = D[1];
    if (h[x] > h[y]) swap(x, y), swap(O[0], O[1]);
    go(cur, y);
    go(cur, O[0], false);
    go(x, y);
    go(cur, O[1], false);
    go(y, y);
  } else if (iu + id == 2) {
    cout << "YES" << endl;
    int x = U[0], y = D[0];
    if (h[x] > h[y]) swap(x, y);
    go(cur, y);
    go(cur, O[0], false);
    go(D[0], y);
    path.push_back(cur);
    go(U[0], y);
  } else
    return false;
  return true;
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  for (int i = 0; i < n; i++)
    if (!mark[i] && dfs(i)) {
      par[i] = -1, h[i] = 0;
      return 0;
    }
  cout << "NO" << endl;
  return 0;
}
