#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
bool visa[(int)1e6] ;
ll cm[(int)1e6];
map <int,int> mp ;
int main() {
	int t;
	cin >> t;
	while ( t-- ) {
		int n , k , p ;
		ll sum = 0 , sm = 0;
		cin >> n >> k;
		vi x(n);
		for (auto&i:x) {
			cin >> i ;
			sm += i ;
		}
		for ( int i = 1 ; i <= n ; i++ ) {
			p = x[i-1];
			sum += p ;
			cm[i] = sum ;
			mp[(sm-cm[i-1])%k]++;
		}
		ll res = 0 ;
		for ( int i = 1 ; i <= n ; i++ ) {
			ll a = k-(cm[i]%k) ;
			if(a==k)a-=k;
			mp[(sm-cm[i-1])%k]--;
			res += mp[a];
		}
		cout << res << endl;
	}
	return 0;
}