divthree_codechef.cpp

#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define pi 3.1415926535
#define endl "\n"
#pragma GCC optimize("Ofast")
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define foi(a, b) for (int i = a; i < b; i++)
#define foll(a, b) for (ll i = a; i < b; i++)
#define max(a, b) a > b ? a : b
#define min(a, b) a < b ? a : b
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t = 0;
    cin >> t;
    while (t--)
    {
        int n;
        long long k, d, temp;
        cin >> n >> k >> d;
        long long sum = 0;
        foi(0, n)
        {
            cin >> temp;
            sum = sum + temp;
        }
        long long ndays = sum / k;
        if (ndays > d)
            cout << d << endl;
        else
        {
            cout << ndays << endl;
        }
    }
    return 0;
}