#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
const int MOD = 998244353;
const ll INF = 1e18;

using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;

void solve1();

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int qwerty = 1;
    // cin >> qwerty;
    while (qwerty--) {
        solve1();
    }
}

void solve1() {
    int T;
    cin >> T;
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    if (n == 2 && a[0] == 1 && a[1] == m) {
        if (m % 2 == 0) {
            cout << "No";
            return;
        }
        if (T >= 2) {
            cout << (m + 1) / 2 << '\n';
            if (T == 3) {
                cout << 1 << '\n';
                cout << m << ' ' << (m + 1) / 2;
            }
        }
        return;
    }
}
