#include <bits/stdc++.h>
using namespace std;
#define int long long
 
void fun(){
	int n;
	cin >> n;
	int a[n], mx = 0;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		mx = max(mx, a[i]);
	}
	sort(a, a+n);
	int ans = 0;
	for(int i = 0; i < n-2; i++){
		for(int j = i+1; j < n-1; j++){
			int h = lower_bound(a, a+n, a[i]+a[j]) - a;
			int k = upper_bound(a, a+n, mx-a[i]-a[j]) - a;
			h = max(h, j+1); k = max(k, j+1);
			//cout << "( " << h << ' ' << k << " )" << '\n';
			ans += max(h-k, 0ll);
		}
	}
	cout << ans << '\n';
}
 
main() {
	int t; cin >> t;
	while(t--)fun();
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgaW50IGxvbmcgbG9uZwoKdm9pZCBmdW4oKXsKCWludCBuOwoJY2luID4+IG47CglpbnQgYVtuXSwgbXggPSAwOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJY2luID4+IGFbaV07CgkJbXggPSBtYXgobXgsIGFbaV0pOwoJfQoJc29ydChhLCBhK24pOwoJaW50IGFucyA9IDA7Cglmb3IoaW50IGkgPSAwOyBpIDwgbi0yOyBpKyspewoJCWZvcihpbnQgaiA9IGkrMTsgaiA8IG4tMTsgaisrKXsKCQkJaW50IGggPSBsb3dlcl9ib3VuZChhLCBhK24sIGFbaV0rYVtqXSkgLSBhOwoJCQlpbnQgayA9IHVwcGVyX2JvdW5kKGEsIGErbiwgbXgtYVtpXS1hW2pdKSAtIGE7CgkJCWggPSBtYXgoaCwgaisxKTsgayA9IG1heChrLCBqKzEpOwoJCQkvL2NvdXQgPDwgIiggIiA8PCBoIDw8ICcgJyA8PCBrIDw8ICIgKSIgPDwgJ1xuJzsKCQkJYW5zICs9IG1heChoLWssIDBsbCk7CgkJfQoJfQoJY291dCA8PCBhbnMgPDwgJ1xuJzsKfQoKbWFpbigpIHsKCWludCB0OyBjaW4gPj4gdDsKCXdoaWxlKHQtLSlmdW4oKTsKfQ==

NgozCjEgMiAzCjQKMSAxIDIgNAo1CjcgNyA3IDcgNwo1CjEgMSAyIDIgNAo2CjIgMyAzIDQgNSA1CjUKMSAxIDEgMSAzCg==

6
3
1 2 3
4
1 1 2 4
5
7 7 7 7 7
5
1 1 2 2 4
6
2 3 3 4 5 5
5
1 1 1 1 3