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;
  template <typename T>
  void read(T &x) {
    cin >> x;
  }
  template <typename T, typename T0>
  void read(T &x, T0 &y) {
    cin >> x >> y;
  }
  template <typename T, typename T0, typename T1>
  void read(T &x, T0 &y, T1 &z) {
    cin >> x >> y >> z;
  }
  template <typename T, typename T0, typename T1, typename T2>
  void read(T &x, T0 &y, T1 &z, T2 &w) {
    cin >> x >> y >> z >> w;
  }
  template <typename T, typename T0>
  void read(pair<T, T0> &p) {
    cin >> p.first >> p.second;
  }
  template <typename T>
  void read(vector<T> &oneD, long long n) {
    for (long long(i) = 0; (i) < (n); ++(i)) {
      long long x;
      read(x);
      oneD.push_back(x);
    }
  }
  template <typename T>
  void read(T oneD[], long long n) {
    for (long long i = 0; i < n; i++) {
      read(oneD[i]);
    }
  }
  template <typename T>
  void write(T &x) {
    cout << x << " ";
  }
  template <typename T>
  void wrtline(T &x) {
    cout << x << "\n";
  }
  template <typename T, typename T0>
  void write(T &x, T0 &y) {
    cout << x << " " << y << "\n";
  }
  template <typename T, typename T0, typename T1>
  void write(T &x, T0 &y, T1 &z) {
    cout << x << " " << y << " " << z << "\n";
  }
  template <typename T, typename T0, typename T1, typename T2>
  void write(T &x, T0 &y, T1 &z, T2 &w) {
    cout << x << " " << y << " " << z << " " << w << "\n";
  }
  template <typename T, typename T0>
  void write(pair<T, T0> &p) {
    write(p.first);
    write(p.second);
    cout << "\n";
  }
  template <typename T>
  void write(vector<T> &oneD, long long n) {
    for (long long i = 0; i < n; i++) {
      cout << oneD[i] << " ";
    }
    cout << "\n";
  }
  template <typename T>
  void write(T oneD[], int &n) {
    for (long long i = 0; i < n; i++) {
      write(oneD[i]);
    }
    cout << "\n";
  }
  template <typename T, typename T0>
  void write(map<T, T0> &mpp) {
    for (auto it : mpp) {
      write(it.first);
      cout << ": ";
      write(it.second);
      cout << "\n";
    }
    cout << "\n";
  }
  template <typename T>
  void write(vector<vector<T>> &rc, T &n, T &m) {
    for (long long(i) = 0; (i) < (n); ++(i)) {
      for (long long(j) = 0; (j) < (m); ++(j)) {
        cout << rc[i][j] << " ";
      }
      cout << "\n";
    }
  }
  template <typename T>
  void _print(T &t) {
    cerr << t;
  }
  template <class T, class V>
  void _print(pair<T, V> &p);
  template <class T>
  void _print(vector<T> &v);
  template <class T>
  void _print(set<T> &v);
  template <class T, class V>
  void _print(map<T, V> &v);
  template <class T>
  void _print(multiset<T> &v);
  template <class T, class V>
  void _print(pair<T, V> &p) {
    cerr << "{";
    _print(p.first);
    cerr << ",";
    _print(p.second);
    cerr << "}";
  }
  template <class T>
  void _print(vector<T> &v) {
    cerr << "[ ";
    for (T i : v) {
      _print(i);
      cerr << " ";
    }
    cerr << "]";
  }
  template <class T>
  void _print(set<T> &v) {
    cerr << "[ ";
    for (T i : v) {
      _print(i);
      cerr << " ";
    }
    cerr << "]";
  }
  template <class T>
  void _print(multiset<T> &v) {
    cerr << "[ ";
    for (T i : v) {
      _print(i);
      cerr << " ";
    }
    cerr << "]";
  }
  template <class T, class V>
  void _print(map<T, V> &v) {
    cerr << "[ ";
    for (auto i : v) {
      _print(i);
      cerr << " ";
    }
    cerr << "]";
  }
  void solve() {
    long long n, a, b;
    read(n, a, b);
    if (a == 0 and b == 0) {
      for (long long(i) = 1; (i) <= (n); ++(i)) {
        cout << i << " ";
      }
      cout << "\n";
      return;
    }
    if (abs(a - b) > 1 or a + b > n - 2) {
      cout << -1 << "\n";
      return;
    }
    vector<long long> ans;
    for (long long(i) = 1; (i) <= (n); ++(i)) {
      ans.push_back(i);
    }
    if (a > b) {
      long long cnt = 0;
      for (long long i = n - 1; i >= 1 and cnt != a; i -= 2) {
        swap(ans[i], ans[i - 1]);
        cnt++;
      }
    } else if (a < b) {
      long long cnt = 0;
      for (long long i = 0; i < n - 1 and cnt != b; i += 2) {
        swap(ans[i], ans[i + 1]);
        cnt++;
      }
    } else {
      long long cnt = 0;
      for (long long i = n - 1; i >= 1 and cnt != a; i -= 2) {
        swap(ans[i], ans[i - 1]);
        cnt++;
      }
      swap(ans[0], ans[1]);
    }
    write(ans, n);
  }
  int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long t;
    read(t);
    while (t--) solve();
    return 0;
  }
  