// Cheese-Cracker: cheese-cracker.github.io

void solve(){
    auto n = scan!int;
    auto arr = iota(1L, n+1L).array;
    long a = scan;
    long b = scan;
    if(abs(a - b) > 1 || a + b > n - 2){
        writeln(-1);
        return;
    }
    long swp = max(a, b);
    if(a > b){
        arr.reverse;
    }
    for(int i = 0; i+1 < n; i += 2){
        if(!swp){
            break;
        }
        swap(arr[i], arr[i+1]);
        --swp;
    }
    long ac = 0, bc = 0;
    for(int i = 1; i < n-1; ++i){
        if(arr[i] > arr[i-1] && arr[i] > arr[i+1]){
            ++ac;
        }else if( arr[i] < arr[i-1] && arr[i] < arr[i+1]){
            ++bc;
        }
    }
    if(ac == a && bc == b){
        for(int i = 0; i < n; ++i){
            write(arr[i], " ");
        }
        writeln;
        return;
    }else if (ac == a || bc == b){
        swap(arr[n-1], arr[n-2]);
        ac = 0; bc = 0;
        for(int i = 1; i < n-1; ++i){
            if(arr[i] > arr[i-1] && arr[i] > arr[i+1]){
                ++ac;
            }else if( arr[i] < arr[i-1] && arr[i] < arr[i+1]){
                ++bc;
            }
        }
    }
    if(ac == a && bc == b){
        for(int i = 0; i < n; ++i){
            write(arr[i], " ");
        }
        writeln;
    }else{
        show(arr);
        writeln(-1);
    }
}

void main(){
    long tests = scan;        // Toggle!
    while(tests--) solve;
}

/**************    *****    That's All Folks!    *****    **************/
import std.stdio, std.range, std.conv, std.typecons, std.algorithm, std.container, std.math;
string[] tk; T scan(T=long)(){while(!tk.length)tk = readln.split; string a=tk.front; tk.popFront; return a.to!T;}
T[] scanArray(T=long)(){ auto r = readln.split.to!(T[]); return r; }
void show(A...)(A a){ debug{ foreach(t; a){stderr.write(t, "| ");} stderr.writeln; } }
alias ll = long, tup = Tuple!(long, "x",  long, "y");
