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.util.*;
  import java.io.*;
  import java.time.*;
  import static java.lang.Math.*;
  
  @SuppressWarnings("unused")
  public class A {
  	static boolean DEBUG = false;
  
  	static Reader fs;
  	static PrintWriter pw;
  
  	static void solve() {
  		int n = fs.nextInt(), a = fs.nextInt(), b = fs.nextInt();
  		/*
  		 *  a == b
  		 *  l r l r l r r to l
  		 *  a > b
  		 *  l r l r l r l to r
  		 *  b > a
  		 *  r l r l r l r to l
  		 */
  		if (a + b > n - 2) {
  			pw.println(-1);
  			return;
  		}
  		ArrayList<Integer>ans = new ArrayList<>();
  		int l = 1, r = n;
  		if (a == b + 1) {
  			int cnt = 0;
  			while(cnt < a) {
  				ans.add(l++);
  				ans.add(r--);
  				cnt++;
  //				System.out.println(cnt + " " + l + " " + r);
  			}
  			for(int i = r ; i >= l ; i--)ans.add(i);
  		} 
  		else if (b == a + 1) {
  			int cnt = 0;
  			while(cnt < b) {
  				ans.add(r--);
  				ans.add(l++);
  				cnt++;
  			}
  			for(int i = l ; i <= r ; i++) {
  				ans.add(i);
  			}
  		} 
  		else if (a == b) {
  			int cnt =0;
  			while(cnt < a) {
  				ans.add(r--);
  				ans.add(l++);
  				cnt++;
  			}
  			for(int i = r ; i >= l ; i--)ans.add(i);
  		} 
  		else {
  			pw.println(-1);
  			return;
  		}
  		for(int x : ans)pw.print(x + " ");pw.println();
  	}
  
  	public static void main(String[] args) throws IOException {
  		Instant start = Instant.now();
  		if (args.length == 2) {
  			System.setIn(new FileInputStream(new File("D:\\program\\javaCPEclipse\\CodeForces\\src\\input.txt")));
  			// System.setOut(new PrintStream(new File("output.txt")));
  			System.setErr(new PrintStream(new File("D:\\program\\javaCPEclipse\\CodeForces\\src\\error.txt")));
  			DEBUG = true;
  		}
  		fs = new Reader();
  		pw = new PrintWriter(System.out);
  		int t = fs.nextInt();
  		while (t-- > 0) {
  			solve();
  		}
  		Instant end = Instant.now();
  		if (DEBUG) {
  			pw.println(Duration.between(start, end));
  		}
  		pw.close();
  	}
  
  	public static void print(long a, long b, long c, PrintWriter pw) {
  		pw.println(a + " " + b + " " + c);
  		return;
  	}
  
  	static class Reader {
  		BufferedReader br;
  		StringTokenizer st;
  
  		public Reader() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}
  
  		String next() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  
  		int[] readArray(int n) {
  			int a[] = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  
  		int[][] read2Array(int n, int m) {
  			int a[][] = new int[n][m];
  			for (int i = 0; i < n; i++) {
  				for (int j = 0; j < m; j++) {
  					a[i][j] = nextInt();
  				}
  			}
  			return a;
  		}
  	}
  }