description: You are given three integers n, a, b. Determine if there exists a permutation p_1, p_2, …, p_n of integers from 1 to n, such that:
  
    * There are exactly a integers i with 2 ≤ i ≤ n-1 such that p_{i-1} < p_i > p_{i+1} (in other words, there are exactly a local maximums).
  
    * There are exactly b integers i with 2 ≤ i ≤ n-1 such that p_{i-1} > p_i < p_{i+1} (in other words, there are exactly b local minimums).
  
  
  
  
  If such permutations exist, find any such permutation.
  
  Input
  
  The first line of the input contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases. The description of test cases follows.
  
  The only line of each test case contains three integers n, a and b (2 ≤ n ≤ 10^5, 0 ≤ a,b ≤ n).
  
  The sum of n over all test cases doesn't exceed 10^5.
  
  Output
  
  For each test case, if there is no permutation with the requested properties, output -1.
  
  Otherwise, print the permutation that you are found. If there are several such permutations, you may print any of them.
  
  Example
  
  Input
  
  
  3
  4 1 1
  6 1 2
  6 4 0
  
  
  Output
  
  
  1 3 2 4
  4 2 3 1 5 6
  -1
  
  Note
  
  In the first test case, one example of such permutations is [1, 3, 2, 4]. In it p_1 < p_2 > p_3, and 2 is the only such index, and p_2> p_3 < p_4, and 3 the only such index.
  
  One can show that there is no such permutation for the third test case.
solution: import java.io.*;
  import java.util.*;
  
  public class Main {
  	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  	static StringTokenizer st;
  	static PrintWriter pr = new PrintWriter(System.out);
  	static String readLine() throws IOException {
  		return br.readLine();
  	}
  	static String next() throws IOException {
  		while (st == null || !st.hasMoreTokens())
  			st = new StringTokenizer(readLine());
  		return st.nextToken();
  	}
  	static int readInt() throws IOException {
  		return Integer.parseInt(next());
  	}
  	static long readLong() throws IOException {
  		return Long.parseLong(next());
  	}
  	static double readDouble() throws IOException {
  		return Double.parseDouble(next());
  	}
  	static char readChar() throws IOException {
  		return next().charAt(0);
  	}
  	static class Pair implements Comparable<Pair> {
  		int f, s;
  		Pair(int f, int s) {
  			this.f = f;
  			this.s = s;
  		}
  		public int compareTo(Pair other) {
  			if (this.f != other.f) return this.f - other.f;
  			return this.s - other.s;
  		}
  	}
  	static void solve() throws IOException {
  		int n = readInt(), a = readInt(), b = readInt();
  		if (Math.abs(a - b) > 1 || a + b > n - 2) {
  			pr.println(-1);
  			return;
  		}
  		if (a > b) {
  			int L = 1, R = n;
  			pr.print(L + " ");
  			++L;
  			for (int i = 1; i < a; ++i) {
  				pr.print(R + " ");
  				pr.print(L + " ");
  				++L;
  				--R;
  			}
  			for (int i = R; i >= L; --i) pr.print(i + " ");
  		} else if (a < b) {
  			int L = 1, R = n;
  			pr.print(R + " ");
  			--R;
  			for (int i = 1; i < b; ++i) {
  				pr.print(L + " ");
  				pr.print(R + " ");
  				++L;
  				--R;
  			}
  			for (int i = L; i <= R; ++i) pr.print(i + " ");
  		} else {
  			int L = 1, R = n;
  			for (int i = 1; i <= a; ++i) {
  				pr.print(L + " ");
  				pr.print(R + " ");
  				++L;
  				--R;
  			}
  			for (int i = L; i <= R; ++i) pr.print(i + " ");
  		}
  		pr.println();
  	}
  	public static void main(String[] args) throws IOException {
  		//solve();
  		for (int t = readInt(); t > 0; --t) solve();
  		pr.close();
  	}
  }
  