#include <bits/stdc++.h>
using namespace std;
inline int read() {
  register int x = 0, f = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar();
  return x * f;
}
const int N = 4e5 + 5;
struct each {
  int x, y;
} a[N];
vector<int> b[N];
vector<int> c[N];
set<int> se1[N], se2[N];
int n, m, now, v[N], vi[N], fa[N], nex[N], vis[N], head[N], deep[N];
inline void addedges(int x, int y) {
  nex[++now] = head[x];
  head[x] = now, v[now] = y;
}
void dfs(int x) {
  vi[x] = 1;
  int si = b[x].size();
  for (int i = 0; i < si; i++) {
    int v = b[x][i];
    if (vi[v]) continue;
    deep[v] = deep[x] + 1, fa[v] = x;
    addedges(x, v), dfs(v), vis[c[x][i]] = 1;
  }
}
int tmp[N];
void way(int x, int y, int ty) {
  int top = 0;
  while (x != y) tmp[++top] = x, x = fa[x];
  if (!ty)
    for (int i = 1; i <= top; i++) printf("%d ", tmp[i]);
  else {
    tmp[++top] = y;
    while (top > 1) printf("%d ", tmp[top--]);
  }
}
void work(int x) {
  for (int i = head[x]; i; i = nex[i]) {
    work(v[i]);
    set<int>::iterator j = se1[v[i]].begin();
    while (j != se1[v[i]].end()) {
      if (!se2[x].count(*j)) se1[x].insert(*j);
      j++;
    }
  }
  if (se1[x].size() > 1) {
    puts("YES");
    set<int>::iterator i = se1[x].begin();
    int fi = *i, se = *(++i), y = a[fi].y;
    if (deep[a[se].y] > deep[y]) y = a[se].y;
    printf("%d ", deep[x] - deep[y] + 1), way(x, y, 0), printf("%d\n", y);
    printf("%d ", deep[a[fi].x] - deep[x] - deep[a[fi].y] + deep[y] + 2);
    way(a[fi].x, x, 1), printf("%d ", a[fi].x), way(y, a[fi].y, 1),
        printf("%d\n", y);
    printf("%d ", deep[a[se].x] - deep[x] - deep[a[se].y] + deep[y] + 2);
    way(a[se].x, x, 1), printf("%d ", a[se].x), way(y, a[se].y, 1),
        printf("%d\n", y);
    exit(0);
  }
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    a[i].x = read(), a[i].y = read();
    b[a[i].x].push_back(a[i].y);
    b[a[i].y].push_back(a[i].x);
    c[a[i].x].push_back(i);
    c[a[i].y].push_back(i);
  }
  for (int i = 1; i <= n; i++)
    if (!vi[i]) dfs(i), vi[i] = 2;
  for (int i = 1; i <= m; i++)
    if (!vis[i]) {
      if (deep[a[i].x] < deep[a[i].y]) swap(a[i].x, a[i].y);
      se1[a[i].x].insert(i), se2[a[i].y].insert(i);
    }
  for (int i = 1; i <= n; i++)
    if (vi[i] == 2) work(i);
  puts("NO");
  return 0;
}
