#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int MAX = 100005;
long long modexp(long long x, long long n) {
  if (n == 0) return 1LL;
  if (n % 2 == 0) {
    long long y = modexp(x, n / 2) % mod;
    return (y * y) % mod;
  }
  return (x * modexp(x, n - 1) % mod) % mod;
}
long long powr(long long x, long long n) {
  long long ans = 1;
  for (int i = 1; i <= n; i++) ans = ans * x;
  return ans;
}
vector<int> v[MAX];
vector<pair<int, int> > edges;
int deg[MAX];
int main() {
  int n, m, h, t;
  scanf("%d", &n), scanf("%d", &m), scanf("%d", &h), scanf("%d", &t);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d", &x), scanf("%d", &y);
    v[x].push_back(y);
    v[y].push_back(x);
    edges.push_back(make_pair(x, y));
    edges.push_back(make_pair(y, x));
    deg[x]++;
    deg[y]++;
  }
  for (int i = 1; i <= n; i++) {
    sort(v[i].begin(), v[i].end());
  }
  m = 2 * m;
  for (int i = 0; i < m; i++) {
    int x = edges[i].first;
    int y = edges[i].second;
    if (deg[x] + deg[y] < (h + t + 2) || deg[x] < h || deg[y] < t) continue;
    int c1 = 0, c2 = 0, c3 = 0;
    int p1 = 0, p2 = 0;
    vector<int> a, b, c;
    while (p1 < v[x].size() && p2 < v[y].size()) {
      if (a.size() == h || c.size() == t) break;
      if (v[x][p1] == y) {
        p1++;
        continue;
      }
      if (v[y][p2] == x) {
        p2++;
        continue;
      }
      if (v[x][p1] < v[y][p2]) {
        a.push_back(v[x][p1]);
        p1++;
      } else if (v[x][p1] == v[y][p2]) {
        b.push_back(v[x][p1]);
        p1++;
        p2++;
      } else {
        c.push_back(v[y][p2]);
        p2++;
      }
    }
    while (p1 < v[x].size()) {
      if (a.size() == h) break;
      if (v[x][p1] == y) {
        p1++;
        continue;
      }
      a.push_back(v[x][p1]);
      p1++;
    }
    while (p2 < v[y].size()) {
      if (c.size() == t) break;
      if (v[y][p2] == x) {
        p2++;
        continue;
      }
      c.push_back(v[y][p2]);
      p2++;
    }
    c1 = a.size();
    c2 = b.size();
    c3 = c.size();
    if (c1 + c2 < h || (c2 - max(0, (h - c1)) + c3 < t)) continue;
    int pos = 0;
    while (c1 < h) {
      c1++;
      a.push_back(b[pos++]);
    }
    printf("YES\n");
    printf("%d %d\n", x, y);
    int pos1 = 0;
    while (h--) printf("%d ", a[pos1++]);
    printf("\n");
    while (c.size() < t) c.push_back(b[pos++]);
    pos1 = 0;
    while (t--) {
      printf("%d ", c[pos1++]);
    }
    return 0;
  }
  printf("NO\n");
  return 0;
}
