#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
const int N = 1e5 + 10;
const int P = 1e9 + 7;
int a[N];
map<int, int>mp;
int read(){
    int x=0,f=1;
    char ch=getchar();
    while(!isdigit(ch)){
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(isdigit(ch)){
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
void solve() {
	int pos = 1;
	priority_queue<int>ans[N];
	mp.clear();
	int n=read();
	for (int i = 1; i <= n; i++)  a[i]=read();
	for (int i = 1; i <= n; i++) {
		int tmp = i - a[i];
		if (mp.find(tmp) != mp.end()) {
			ans[mp[tmp]].push(a[i]);
		} else {
			mp[tmp] = pos++;
			ans[mp[tmp]].push(a[i]);
		}
	}
	int res = 0;
	for (int i = 1; i < pos; i++) {
		while(ans[i].size()>=2){
			int tmp=ans[i].top();
			ans[i].pop();
			tmp+=ans[i].top();
			ans[i].pop();
			if(tmp>0) res+=tmp;
		}
	}
	cout<<res<<endl;
}

signed main() {

	int _  =read();
	while (_--) {
		solve();
	}
	return 0;
}