#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void input(T &x) {
  register char c = getchar();
  x = 0;
  int neg = 0;
  for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
  if (neg) x = -x;
}
inline long long bigmod(long long p, long long e, long long M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
const int N = 1e5 + 5;
int n, m, h, t;
vector<int> g[N];
int x[N], y[N];
int flag[N];
int v1[N], v2[N], v3[N];
bool solve(int u, int v) {
  int n1 = 0;
  for (auto x : g[u])
    if (x != v) {
      flag[x] = 1;
      v1[n1++] = x;
      if (n1 > h + t) break;
    }
  int n2 = 0, n3 = 0;
  for (auto x : g[v])
    if (x != u) {
      if (flag[x]) v3[n3++] = x, flag[x] = 2;
      v2[n2++] = x;
      if (n2 > h + t) break;
    }
  int d1 = n1 - n3, d2 = n2 - n3;
  int need = max(0, h - d1) + max(0, t - d2);
  if (need <= n3) {
    printf("YES\n");
    printf("%d %d\n", u, v);
    int pr = 0;
    for (int i = 0; i < n1 && pr < h; i++) {
      if (flag[v1[i]] == 2) continue;
      printf("%d ", v1[i]);
      pr++;
    }
    int ptr = 0;
    while (ptr < n3 && pr < h) printf("%d ", v3[ptr++]), pr++;
    puts("");
    pr = 0;
    for (int i = 0; i < n2 && pr < t; i++) {
      if (flag[v2[i]] == 2) continue;
      printf("%d ", v2[i]);
      pr++;
    }
    while (ptr < n3 && pr < t) printf("%d ", v3[ptr++]), pr++;
    return 1;
  }
  for (int i = 0; i < n1; i++) flag[v1[i]] = 0;
  return 0;
}
int main() {
  input(n), input(m);
  input(h), input(t);
  for (int i = 0; i < m; i++) {
    input(x[i]), input(y[i]);
    g[x[i]].push_back(y[i]);
    g[y[i]].push_back(x[i]);
  }
  for (int i = 0; i < m; i++) {
    bool k = solve(x[i], y[i]);
    if (k) return 0;
    k = solve(y[i], x[i]);
    if (k) return 0;
  }
  printf("NO\n");
  return 0;
}
