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: #include <bits/stdc++.h>
  using namespace std;
  int main() {
    int t;
    cin >> t;
    while (t--) {
      int n, a, b, i, j;
      cin >> n >> a >> b;
      int arr[n];
      if (abs(a - b) > 1 || a + b > n - 2) {
        cout << "-1" << endl;
      } else if (a == 0 && b == 0) {
        for (i = 0; i < n; i++) {
          cout << i + 1 << " ";
        }
        cout << endl;
      } else if (a == 0) {
        arr[1] = 1;
        arr[0] = 2;
        for (i = 2; i < n; i++) {
          arr[i] = i + 1;
        }
        for (i = 0; i < n; i++) {
          cout << arr[i] << " ";
        }
        cout << endl;
      } else if (b == 0) {
        arr[0] = n - 1;
        arr[1] = n;
        int x = n - 2;
        for (i = 2; i < n; i++) {
          arr[i] = x;
          x--;
        }
        for (i = 0; i < n; i++) {
          cout << arr[i] << " ";
        }
        cout << endl;
      } else if (a > b) {
        int x = n;
        int y = a;
        int end = 0;
        for (i = 1; i < n - 1; i += 2) {
          if (y == 1) {
            break;
          }
          arr[i] = x;
          x--;
          y--;
          end = i;
        }
        arr[n - 2] = x;
        x--;
        int x1 = 1;
        for (i = 2; i < end; i += 2) {
          arr[i] = x1;
          x1++;
        }
        for (i = end + 1; i < n - 2; i++) {
          arr[i] = x;
          x--;
        }
        arr[n - 1] = x;
        x--;
        arr[0] = x;
        for (i = 0; i < n; i++) {
          cout << arr[i] << " ";
        }
        cout << endl;
      } else if (b > a) {
        int x = 1;
        int y = b;
        int end = 0;
        for (i = 1; i < n - 1; i += 2) {
          if (y == 1) {
            break;
          }
          arr[i] = x;
          x++;
          y--;
          end = i;
        }
        arr[n - 2] = x;
        x++;
        int x1 = n;
        for (i = 2; i < end; i += 2) {
          arr[i] = x1;
          x1--;
        }
        for (i = end + 1; i < n - 2; i++) {
          arr[i] = x1;
          x1--;
        }
        arr[n - 1] = x1;
        x1--;
        arr[0] = x1;
        for (i = 0; i < n; i++) {
          cout << arr[i] << " ";
        }
        cout << endl;
      } else if (a == b) {
        int x = n;
        int y = 1;
        int end = 0;
        for (i = 1; i < n; i += 2) {
          if (a == 0) {
            break;
          }
          arr[i] = x;
          x--;
          a--;
          end = i;
        }
        for (i = 2; i < end; i += 2) {
          arr[i] = y;
          y++;
        }
        for (i = end + 1; i < n; i++) {
          arr[i] = y;
          y++;
        }
        arr[0] = y;
        for (i = 0; i < n; i++) {
          cout << arr[i] << " ";
        }
        cout << endl;
      }
    }
    return 0;
  }
  