#pragma GCC optimize(3,"Ofast","inline")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll; 
#define int long long
#define ld long double
int n,a[100010];
vector<array<int,2>>z;
bool cmp(array<int,2> z,array<int,2> y){
	if(z[0]==y[0]) return z[1]>y[1];
	return z[0]<y[0];
	
}
int b[100010];
void solve()
{ cin>>n;z.clear();
int sum=0;
for(int i=1;i<=n;i++) {cin>>a[i];
b[i-1]=0;
int ti=a[i];//边权
a[i]=a[i]-i;//点
z.push_back({a[i],ti});
}
	sort(z.begin(),z.end(),cmp);
for(int i=0;i<z.size()-1;i++){
	if(b[i]) continue;
	int zid=z[i][0],yid=z[i+1][0];
	if(zid!=yid) continue;
	int ti=z[i][1]+z[i+1][1];
	if(ti>=0) {
		sum+=ti;
		b[i+1]=1;
	}
	
}



	 cout<<sum<<endl;
}
signed main()
{
	ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
	int t; cin>>t;
	while(t--)
{
	solve();
}
	
	
	return 0;
}