#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#define N 10010#define inf (1<<25)using namespace std;int dp[N],num[N];int main (){ int t,n,a,b; int i,j,k; int max; scanf("%d",&t); while (--t>=0) { scanf("%d%d%d",&n,&a,&b); for (i=0;i<n;++i) scanf("%d",&num[i]); sort(num,num+n); memset(dp,0,sizeof(dp)); dp[n-1]=num[n-1]; for (i=n-2;i>=0&&num[i]>=a;--i) { max=-inf; for (j=i+1;num[j]-num[i]<=b&&j<n;++j) { if (num[j]-num[i]<a) continue; if (max<dp[j]) max=dp[j]; } if (max!=-inf) dp[i]=num[i]-max; else dp[i]=num[i]; } max=-inf; for (i=0;num[i]<a&&i<n;++i); for (;i<n&&num[i]<=b;++i) if (max<dp[i]) max=dp[i]; printf("%dn",max==-inf?0:max); } return 0;}
