#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acosl(-1);

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, set<T> v) {
  os << "(set";
  for (T item: v) os << ' ' << item;
  os << ")";
  return os;
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

//           ^   >  v   <
int dx[] = { -1, 0, 1,  0 };
int dy[] = {  0, 1, 0, -1 };

using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.setf(ios::fixed);
  cout.precision(10);
  random_device dev;
  mt19937 rand(dev());

  int n, d, k; cin >> n >> d >> k;
  vector<vector<set<int>>> table(k+1, vector<set<int>> (d+1));
  // table[i][j] = i個買ってj円であるようなセット

  for (int i = 1; i <= k; ++i) {
    for (int j = 1; j <= d; ++j) {
      for (int j2 = max(0, j-n); j2 < j; ++j2) {
        int a = j-j2;
        if (table[i-1][j2].size() == (i-1) and table[i-1][j2].count(a) == 0) {
          table[i][j] = table[i-1][j2];
          table[i][j].insert(a);
          assert(table[i][j].size() == i);
          break;
        }
      }
    }
  }

  if (table[k][d].size() == 0) {
    cout << -1 << endl;
  } else {
    vi ans;
    for (int x: table[k][d])
      ans.push_back(x);
    cout << ans << endl;
  }

  return 0;
}