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

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MP(x,y) make_pair((x), (y))
#define MIN(a,b) (a < b ? a : b)
#define MAX(a,b) (a > b ? a : b)
#define AMIN(a,b) if(b < a) (a) = (b)
#define AMAX(a,b) if(b > a) (a) = (b)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define bitcount(b) __builtin_popcount(b)
#define GCD(a,b) (__gcd(a,b))
#define GCD3(a,b,c) (GCD(GCD(a,b), c))
#define LCM(a,b) (a/GCD(a,b)*b)
#define LCM3(a,b,c) LCM(LCM(a,b),c)
#define MOD 1000000007
typedef long long ll;
// -------------------------------------

int N, D, K;

bool can(int a, int n, int d, int k) {
  if (n - a + 1 < k) return false;
  int l = 0;
  int h = 0;
  REP(i, k) {
    l += a + i;
    h += n - i;
  }
  return l <= d && d <= h;
}

int main() {
  cin >> N >> D >> K;

  vector<int> ans;
  if (can(1, N, D, K)) {
    FOR(i, 1, N + 1) {
      if (can(i + 1, N, D - i, K - 1)) {
        ans.push_back(i);
        D -= i;
        K--;
      }
    }
  }
  else cout << -1 << endl;

  ITR(i, ans) {
    if (i != ans.begin()) cout << ' ';
    cout << *i;
  }
  cout << endl;

  return 0;
}