#include <bits/stdc++.h>
using namespace std;

#pragma region Macros
#define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define m1 cout << -1 << endl
#pragma endregion

#pragma region Math
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#pragma endregion

void solve() {
    ll n,l,r;   cin>>n>>l>>r;
    vector<int>v(n), a,b;
    for(auto &it:v) cin>>it;
    ll sum1=0, sum2=0;
    for(int i=0;i<r;i++)
        a.push_back(v[i]);
    for(int i=l-1;i<n;i++)
        b.push_back(v[i]);
    sort(all(a));
    sort(all(b));
    for(int i=0;i<r-l+1;i++){
        sum1+=a[i];
        sum2+=b[i];
    }
    cout<<min(sum1, sum2)<<endl;
}

int main() {
    Faster;
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}