#include <cstdio>
#include <vector>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(), w.end());
long long sum = 0;
long long L = l;
long long U = u;
for (int i = 0; i < w.size(); i++) {
sum += w[i];
if (sum >= L) {
if (sum <= U) {
return vector <int>(w.begin(), w.begin()+i+1);
}
return vector<int>(0);
}
}
return vector <int>(0);
}
/*
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> result = find_subset(l, u, w);
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
*/
