#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
ll t, n, m, a[200002], i;
char c[200002];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> t >> n >> m;
    for (i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (i = 1; i <= n; i++) {
        cin >> c[i];
    }
    if (m % 2 == 0) {
        cout << "No";
        return 0;
    }
    cout << "Yes\n";
    if (t == 1) {
        return 0;
    }
    cout << (m + 1) / 2 << endl;
    if (t == 2) {
        return 0;
    }
    cout << 1 << endl << m / 2 << ' ' << (m + 1) / 2;
    return 0;
}
