A_Jellyfish_and_Undertale.cpp

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define pb push_back 
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()
#define forn(i, k, n) for(int i = k; i < n; i++)

typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int INF = 1e9;
//const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;


void solve(){
    
    int a,b,n;
    cin>>a>>b>>n;
    int arr[n];
    forn(i,0,n)
        cin>>arr[i];
    ll t=0;
    t+=b;
    if (b==0){
        cout<<"0\n";
        return;
    }
    if (a==1){
        cout<<1<<"\n";
        return;
    }
    int flag = 0;
    forn(i,0,n){
        if(arr[i]+1<a){
            t+=min(a,arr[i]);
        }else{
            t+=a-1;
        }
    }
    cout<<t<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int t=1;
    cin>>t;

        while(t--) 
            solve();

        
        return 0;
    }