#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

//* Template 1

int consistency1(int n, int l, int r){
	
	unordered_map<int,int> mp;
	for(int i=l; i<=r; i++) mp[i]++;
	
	int s = 0, e = 0;
	int count = r-l+1;
	
	int len = INF;
	
	while(e<n){
		if(a[e] >= l && a[e] <= r){
			mp[a[e]]--;
			if(mp[a[e]] == 0) count--;
		}
		
		if(count > 0){
			e++;
		}
		else{
			while(s<=e && count == 0){
				len = min(len, e-s+1);
				if(a[s] >= l && a[s] <= r){
					mp[a[s]]++;
					if(mp[a[s]] == 1) count++;
				}
				s++;
			}
			e++;
		}
	}
	
	if(len == INF) return -1;
	return len;
}







//* Template 2

int consistency2(int n, int l, int r){
	
	unordered_map<int,int> mp;
	for(int i=l; i<=r; i++) mp[i]++;
	
	int count = r-l+1;
	
	int len = INF;
	
	for(int i=0, j=0; i<n; i++){
		if(a[i] >= l && a[i] <= r){
			mp[a[i]]--;
			if(mp[a[i]] == 0) count--;
		}
		
		while(j<=i && count == 0){
			len = min(len, i-j+1);
			if(a[j] >= l && a[j] <= r){
				mp[a[j]]++;
				if(mp[a[j]] == 1) count++;
			}
			j++;
		}
	}
	
	if(len == INF) return -1;
	return len;
}





















int practice(int n, int l, int r){


    return 0;
}





void solve() {
    
    int n, l, r;
    cin>> n >> l >> r;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, l, r) << " " << consistency2(n, l, r) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}