func_code_string: #include <bits/stdc++.h>   using namespace std;   void __print(int x) { cerr << x; }   void __print(long x) { cerr << x; }   void __print(long long x) { cerr << x; }   void __print(unsigned x) { cerr << x; }   void __print(unsigned long x) { cerr << x; }   void __print(unsigned long long x) { cerr << x; }   void __print(float x) { cerr << x; }   void __print(double x) { cerr << x; }   void __print(long double x) { cerr << x; }   void __print(char x) { cerr <<      << x <<     ; }   void __print(const char *x) { cerr <<     << x <<    ; }   void __print(const string &x) { cerr <<     << x <<    ; }   void __print(bool x) { cerr << (x ?  true  :  false ); }   template <typename T, typename V>   void __print(const pair<T, V> &x) {     cerr <<  { ;     __print(x.first);     cerr <<  , ;     __print(x.second);     cerr <<  } ;   }   template <typename T>   void __print(const T &x) {     int f = 0;     cerr <<  { ;     for (auto &i : x) cerr << (f++ ?  ,  :   ), __print(i);     cerr <<  } ;   }   void _print() { cerr <<  ] n ; }   template <typename T, typename... V>   void _print(T t, V... v) {     __print(t);     if (sizeof...(v)) cerr <<  ,  ;     _print(v...);   }   void pre() {}   long long a[200009];   long long n, p, k;   long long dp[200009];   void solve() {     cin >> n >> p >> k;     for (int i = 0; i < (n); ++i) cin >> a[i + 1], dp[i] = -1;     sort(a + 1, a + n + 1);     dp[0] = 0;     long long ans = 0;     for (int i = 1; i <= (n); ++i) {       if (i >= k)         dp[i] = min(dp[i - 1], dp[i - k]) + a[i];       else         dp[i] = dp[i - 1] + a[i];       if (dp[i] <= p) ans = i;     }     cout << ans <<   n ;   }   int main() {     cin.sync_with_stdio(0);     cin.tie(0);     cin.exceptions(cin.failbit);     pre();     int t;     cin >> t;     for (int i = 0; i < (t); ++i) solve();     return 0;   }   