#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
long long powmod(long long a, long long b, long long c) {
  if (b == 0) return 1;
  long long ret = powmod(a, b >> 1, c);
  ret = ret * ret % c;
  if (b & 1) ret = ret * a % c;
  return ret;
}
template <class T>
void maxe(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void mine(T &a, T b) {
  if (a > b) a = b;
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  T b = 1;
  char c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 222222;
const int M = 111111;
int test;
int n, m, k, ans;
int n1, n2;
int x[N], y[N];
int s1[N], cnt1, s2[N], cnt2;
int sx[N], cntx, sy[N], cnty, sxy[N], cntxy;
int vis[N];
vector<int> v[N];
int d[N];
int cur;
void find(int x, int y, int *s, int &cnts) {
  for (int i = 0, sz = min((int)v[x].size(), n1 + n2 + 1); i < sz; i++) {
    int t = v[x][i];
    if (t == y) continue;
    s[++cnts] = t;
    vis[t]++;
  }
}
void separate(int *s, int &cnts, int *ss, int &cntss) {
  for (int i = 1; i <= cnts; i++)
    if (vis[s[i]] == 1)
      ss[++cntss] = s[i];
    else
      sxy[++cntxy] = s[i];
}
void print(int *s, int cnts, int n) {
  for (int i = 1; i <= min(n, cnts); i++) printf("%d ", s[i]);
  for (int i = cnts + 1; i <= n; i++) printf("%d ", sxy[++cur]);
  puts("");
}
void clear(int *s, int cnts) {
  for (int i = 1; i <= cnts; i++) vis[s[i]] = 0;
}
void print_s(int *s, int cnts) {
  printf(" *");
  for (int i = 1; i <= cnts; i++) printf(" %d", s[i]);
  puts("");
}
int check(int x, int y) {
  if (d[x] <= n1) return 0;
  if (d[y] <= n2) return 0;
  cnt1 = cnt2 = cntx = cnty = cntxy = 0;
  find(x, y, s1, cnt1);
  find(y, x, s2, cnt2);
  separate(s1, cnt1, sx, cntx);
  separate(s2, cnt2, sy, cnty);
  cntxy >>= 1;
  int ret = (min(n1, cntx) + min(n2, cnty) + cntxy >= n1 + n2);
  if (ret) {
    puts("YES");
    printf("%d %d\n", x, y);
    cur = 0;
    print(sx, cntx, n1);
    print(sy, cnty, n2);
  } else {
    clear(sx, cntx);
    clear(sy, cnty);
    clear(sxy, cntxy);
  }
  return ret;
}
int getans() {
  for (int i = 1; i <= m; i++) {
    if (check(x[i], y[i])) return 1;
    if (check(y[i], x[i])) return 1;
  }
  return 0;
}
int main() {
  scanf("%d%d%d%d", &n, &m, &n1, &n2);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x[i], &y[i]);
    v[x[i]].push_back(y[i]);
    d[x[i]]++;
    v[y[i]].push_back(x[i]);
    d[y[i]]++;
  }
  ans = getans();
  if (!ans) puts("NO");
  return 0;
}
