#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if(p!=-1){ x%=p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; vectorans; int n,d,k; int dp[101][1005][11]; bool rec(int cur,int rest,int id){ if(dp[cur][rest][id]>-1)return dp[cur][rest][id]; if(id>k)return false; if(id==k&&rest==0)return true; for(int i=cur;i<=n;++i){ if(rec(i+1,rest-i,id+1)){ ans.eb(i); return dp[cur][rest][id]=true; } } return dp[cur][rest][id]=false; } void solve() { cin>>n>>d>>k; rep(i,n+1)rep(j,d+1)rep(x,k+1)dp[i][j][x]=-1; rec(1,d,0); if(ans.empty()){ cout<<-1<<"\n"; } else{ reverse(all(ans)); rep(i,ans.size()){ cout<