#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ll cases;
    cin>>cases;
    while(cases--)
    {
        ll m,k;
        cin>>m>>k;
        ll arr[12];
        for(ll i=0;i<12;i++)
        {
            cin>>arr[i];
        }
        ll count=0;
        ll sum=0;
        ll i=0;
        while(count!=k)
        {
            sum=sum+arr[i];
            count++;
            i++;
        }
        if((sum-k*m)<0)
        cout<<0<<"\n";
        else
        cout<<sum- k*m<<"\n";
    }
}

T= int(input())
while T>0: 
    n,k=map(int,input().split())
    a=list(map(int,input().strip().split()))
    sm = 0
    i = 0
    while i<k:
        sm += a[i]
        i +=1
    if sm- (k*n) < 0:
            print(0)
    else :
            print(sm- (k*n))
    T-=1

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll t = 1;
    cin >> t;
    while (t--)
    {
        string s;
        cin >> s;
        string hh = "", mm = "";
        hh += s[0], hh += s[1], mm += s[3], mm += s[4];
        ll HH = stol(hh), MM = stol(mm);
        ll time_left = (23 * 60) + (59) - ((HH * 60) + MM);
        cout << time_left << "\n";
    }
}

T=int(input())
for i in range(T):
    s=input()
    HH = int(s[0]+s[1])
    MM = int(s[3]+s[4])
    time_left = (23 * 60) + (59) - ((HH * 60) + MM)
    print(time_left)

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define frn(i,a,b) for(ll i=a;i<b;i++)
#define fri for(auto it=mp.begin();it!=mp.end();it++)
#define its(it) it->second 
#define itf(it) it->first 
#define maximum *max_element
#define minimum *min_element
#define sra(a) sort(a,a+n)
#define srv(v) sort(v.begin(),v.end());
#define dam(mp) map<ll,ll> mp;
#define f first
#define s second
 
//Code
void solve()
{
 ll n;
 cin>>n;
 ll ans= (n*(n+1))/2 + n*(n-1);
 cout<<ans<<"\n";
 
 }
 
int main()
{
   //fast I/O
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    ll cases;
    cin>>cases;
    while(cases--)
    {
        solve(); 
  }
}

T= int(input())
while T>0: 
    n = int(input())
    res = (n*(n+1))//2 
    res += n*(n-1)
    print(res)
    T-=1

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long t = 1;
    cin >> t;
    while (t--)
    {
        long long N;
        cin >> N;
        long long cnt = 0;
        bool flag = 0;
        if (N == 1)
        {
            cout << "Vandit" << endl;
            continue;
        }
        while (N > 1)
        {
            if (N % 2)
            {
                flag = 1;
                break;
            }
            else
            {
                N /= 2;
                cnt++;
            }
        }
        if (flag)
            cout << "Gaurish" << endl;
        else if (cnt % 2)
            cout << "Shiva" << endl;
        else
            cout << "Vandit" << endl;
    }
}

T=int(input())
for i in range(T):
    N=int(input())
    cnt=0
    flag=False
    if N==1:
        print('Vandit')
        continue
    while N>1:
        if N%2:
            flag=True
            break
        else :
            N/=2
            cnt+=1
    if flag :
        print('Gaurish')
    elif cnt%2:
        print('Shiva')
    else :
        print('Vandit')
        
    

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>  
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
ll MOD = 998244353;
double eps = 1e-12;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pai;
typedef string ss;
typedef pair<double,double> pdd;
typedef vector<ss> vees;
typedef vector<ll> vec;
typedef vector<vector<ll> > vv;
#define forr(i,n) for(ll i=0;i<n;i++)
#define fore(i,n,m) for(ll i=m;i<n;i++)
#define ffor(i,n) for(ll i=n;i>=0;i--)
#define rfork(i,n,m) for(ll i=m;i>=n;i--)
#define nl "\n"
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define jaldisejaldi() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).length())
 
 
void solve(){
    string s;cin>>s;
    int j;
    int ans =0;
    for(int i = 0;i<s.length();i++){
        // cout<<"a";
        if(s[i]=='l'){
            ans++;
            j = i;
            break;
        }
    }
    for(int i = j;i<s.length();i++){
        if(s[i]=='o'){
            ans++;
            j = i;
            break;
        }
    }
    for(int i = j;i<s.length();i++){
        if(s[i]=='v'){
            ans++;
            j = i;
            break;
        }
    }
    for(int i = j;i<s.length();i++){
        if(s[i]=='e'){
            ans++;
            break;
        }
    }
    // cout<<ans;
    if(ans == 4) cout<<"girlfriend\n";
    else cout<<"friendzoned\n";
}
int main()
{
    jaldisejaldi();
    ll t;
    cin >> t;
    for(int it=1;it<=t;it++) {
        solve();
    }
    return 0;
}

T= int(input())
while T>0: 
    s=input()
    cnt=0
    for x in s :
            if cnt==0 and x=='l' :
                cnt +=1
            if cnt==1 and x=='o' :
                cnt +=1
            if cnt==2 and x=='v' :
                cnt +=1
            if cnt==3 and x=='e' :
                cnt +=1
                break
    if cnt == 4:
        print("girlfriend")
    else :
        print("friendzoned")
    T-=1

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>  
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
ll MOD = 998244353;
double eps = 1e-12;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pai;
typedef string ss;
typedef pair<double,double> pdd;
typedef vector<ss> vees;
typedef vector<ll> vec;
typedef vector<vector<ll> > vv;
#define forr(i,n) for(ll i=0;i<n-1;i++)
#define fore(i,n,m) for(ll i=m;i<n;i++)
#define ffor(i,n) for(ll i=n;i>=0;i--)
#define rfork(i,n,m) for(ll i=m;i>=n;i--)
#define nl "\n"
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define jaldisejaldi() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
void solve(){
    int x;cin>>x;
    int arr[x];
    for(int i= 0; i<x;i++) cin>>arr[i];
    int ans = 0;
    forr(i,x){
        forr(j,x){
            if(arr[j]>arr[j+1]) {
                ans++;
                swap(arr[j],arr[j+1]);
            }
        }
    }
    cout<<ans<<"\n";
}
 
int main()
{
    jaldisejaldi();
    ll t;
    cin >> t;
    for(int it=1;it<=t;it++) {
        solve();
    }
    return 0;
}

T= int(input())
while T>0: 
    n =int(input())
    a = list(map(int,input().split()))
    ans = 0
    for i in range(n):
	    for j in range(n-1):
		      if(a[j]>a[j+1]):
				     a[j],a[j+1]=a[j+1],a[j]
				     ans+=1
    print(ans)
    T-=1

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long T = 1;
    cin >> T;
    while (T--)
    {
        long long N;
        cin >> N;
        if (N % 4 == 3)
            cout << 0 << "\n";
        else if (N % 4 == 0)
            cout << N << "\n";
        else if (N % 4 == 1)
            cout << (N ^ (N - 1)) << "\n";
        else
            cout << ((N ^ (N - 1)) ^ (N - 2)) << "\n";
    }
}

T=int(input())
for i in range(T):
    N=int(input())
    if N%4 == 3:
        print(0)
    elif N % 4 == 0:
        print(N)
    elif N % 4 == 1:
        print(N ^ (N - 1))
    else :
        print((N ^ (N - 1)) ^ (N - 2))

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long t;
    cin >> t;
    while (t--)
    {
        long long n, a, b, c;
        cin >> a >> b >> c >> n;
        if (n == 1)
        {
            cout << a << "\n";
            continue;
        }
        if (n == 2)
        {
            cout << b << "\n";
            continue;
        }
        if (n == 3)
        {
            cout << c << "\n";
            continue;
        }
        long long t1 = b - a, t2 = c - b;
        long long d = t2 - t1;
        n--;
        long long sm = (2 * t1) + ((n - 1) * d);
        sm *= n, sm /= 2, sm += a;
        cout << sm << endl;
    }
}

def Nth_term(A, N):
    B = [A[1] - A[0], A[2] - A[1]]
    C = B[1] - B[0]
    x, y, z = C, B[0], A[0]
    A_N = ((x * N * N) + (((2 * y) - (3 * x)) * N) + ((2 * z) - (2 * y) + (2 * x))) // 2
    return A_N
 
for _ in range(int(input())):
    A = list(map(int, input().split()))
    N = int(input())
    print(Nth_term(A, N))