#include <bits/stdc++.h>
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline void sub(long long &a, long long b) {
  a -= b;
  if (a < 0) a += 1000000009;
}
inline void add(long long &a, long long b) {
  a += b;
  if (a >= 1000000009) a -= 1000000009;
}
template <typename T>
inline T const &MAX(T const &a, T const &b) {
  return a > b ? a : b;
}
template <typename T>
inline T const &MIN(T const &a, T const &b) {
  return a < b ? a : b;
}
inline long long qp(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 1000000009;
    a = a * a % 1000000009, b >>= 1;
  }
  return ans;
}
inline long long qp(long long a, long long b, long long c) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % c;
    a = a * a % c, b >>= 1;
  }
  return ans;
}
using namespace std;
const unsigned long long ba = 233;
const double eps = 1e-5;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 200000 + 10, maxn = 1000000 + 10, inf = 0x3f3f3f3f;
vector<int> v[N], road;
int dfn[N], low[N][2], fa[N];
pair<int, int> pos[N][2];
int ind;
bool ok;
void pr() {
  printf("%d", road.size());
  for (int i = 0; i < road.size(); i++) printf(" %d", road[i]);
  puts("");
  road.clear();
}
void tarjan(int u, int f) {
  if (ok) return;
  dfn[u] = low[u][0] = low[u][1] = ++ind;
  for (int i = 0; i < v[u].size(); i++) {
    int x = v[u][i];
    if (x == f) continue;
    if (!dfn[x]) {
      fa[x] = u;
      tarjan(x, u);
      if (low[x][1] < low[u][0]) {
        low[u][1] = low[u][0];
        pos[u][1] = pos[u][0];
        low[u][0] = low[x][1];
        pos[u][0] = pos[x][1];
      } else if (low[x][1] < low[u][1]) {
        low[u][1] = low[x][1];
        pos[u][1] = pos[x][1];
      }
      if (low[x][0] < low[u][0]) {
        low[u][1] = low[u][0];
        pos[u][1] = pos[u][0];
        low[u][0] = low[x][0];
        pos[u][0] = pos[x][0];
      } else if (low[x][0] < low[u][1]) {
        low[u][1] = low[x][0];
        pos[u][1] = pos[x][0];
      }
    } else if (dfn[x] < dfn[u]) {
      if (dfn[x] < low[u][0]) {
        low[u][1] = low[u][0];
        pos[u][1] = pos[u][0];
        low[u][0] = dfn[x];
        pos[u][0] = make_pair(u, x);
      } else if (dfn[x] < low[u][1]) {
        low[u][1] = dfn[x];
        pos[u][1] = make_pair(u, x);
      }
    }
  }
  if (low[u][1] < dfn[u] && !ok) {
    ok = 1;
    puts("YES");
    for (int now = u; now != pos[u][1].second; now = fa[now])
      road.push_back(now);
    road.push_back(pos[u][1].second);
    pr();
    road.push_back(pos[u][1].second);
    for (int now = pos[u][1].first; now != u; now = fa[now])
      road.push_back(now);
    road.push_back(u);
    reverse(road.begin(), road.end());
    pr();
    for (int now = pos[u][1].second; now != pos[u][0].second; now = fa[now])
      road.push_back(now);
    road.push_back(pos[u][0].second);
    for (int now = pos[u][0].first; now != u; now = fa[now])
      road.push_back(now);
    road.push_back(u);
    reverse(road.begin(), road.end());
    pr();
    return;
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    dfn[i] = low[i][0] = low[i][1] = fa[i] = 0;
    v[i].clear();
  }
  ind = 0;
  for (int i = 0, x, y; i < m; i++) {
    scanf("%d%d", &x, &y);
    v[x].push_back(y), v[y].push_back(x);
  }
  ok = 0;
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i, -1);
  if (!ok) puts("NO");
  return 0;
}
