#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long
const int maxn=100010;

int n;
int a[maxn];

ll x,y,x2,y2;
int c[maxn];

int main()
{
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%lld%lld",&n,&x,&y);
		x2=y2=0LL;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			x2+=(ll)(i+1)*(ll)a[i];
			y2+=(ll)(i+1)*(ll)a[i]*(ll)a[i];
		}
		ll xx=x-x2,yy=y-y2;
		if(!xx&&yy||!yy&&xx||(xx&&yy%xx!=0)){
			printf("0\n");
			continue;
		}
		if(xx<0&&yy>0||xx>0&&yy<0){
			printf("0\n");
			continue;
		}
		ll ans=0;
		if(!xx&&!yy){
			memset(c,0,sizeof(c));
			for(int i=0;i<n;i++){
				c[a[i]]++;
			}
			for(int i=1;i<=100000;i++){
				if(c[i]>=2)
					ans+=(ll)c[i]*(ll)(c[i]-1)/2; 
			}
			printf("%lld\n",ans);
			continue;
		}
		ll h=yy/xx;
		for(int i=0;i<n;i++){
			int a2=h-a[i];// a[i] a2
			if(a[i]==a2) continue;//
			int k=xx/(a[i]-a2);
			if(k<0) continue;
			if((i+k)<n&&a[i+k]==a2){
				ans++;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}