#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
const ll N=1000005;
const ll inf=1e18;
ll pow10[20];
ll change_len(ll x)
{
    ll cnt=0;
    while(x)
    {
        x/=10;
        cnt++;
    }
    return cnt;
} 
void solve()
{
    ll n,l,r;
    cin>>n>>l>>r;
    vector<ll>a(n+5);
    for(ll i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a.begin()+1,a.begin()+n+1); 
    ll ans=0;
    for(ll i=1;i<=n;i++)
    {
        ll len=change_len(a[i]);
        ll left=(l-a[i]+pow10[len]-1)/pow10[len];
        ll right=(r-a[i])/pow10[len];
        if(left<=right)
        {
            ans+=upper_bound(a.begin()+1,a.begin()+n+1,right)-lower_bound(a.begin()+1,a.begin()+n+1,left);
        }
    }
    cout<<ans<<"\n";
}

int main()
{
    //freopen(".inp","r",stdin);
    //freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    ll T;
    cin>>T;
    pow10[0]=1;
    for(int i=1;i<=16;i++) pow10[i]=pow10[i-1]*10;
    while(T--)
    {
        solve();
    }
    return 0;
}
/*

  l<= x*10^lenai + a[i]<=r
  (l-a[i])/p <= x <= (r-a[i])/p

*/