#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; template struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } static constexpr int get_mod() noexcept {return m;} static constexpr int primitive_root() noexcept { assert(m == 998244353); return 3; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; /* using mint = modint<998244353>; */ using mint = modint<1000000007>; vector> PrimeFactorize(long long N) { vector> res; for(long long p = 2;p * p <= N;p++) { if(N % p != 0) { continue; } res.push_back(make_pair(p,0)); while(N % p == 0) { N /= p; res.back().second++; } } if(N > 1) { res.push_back(make_pair(N,1)); } return res; } void Main() { int N; long long M,K; cin >> N >> M >> K; vector A(N); iota(A.begin(),A.end(),0); vector B; int cur = N - 1; while(K) { if(K >= cur) { K -= cur; B.push_back(A.back()); A.pop_back(); } else { break; } cur--; } if(K > 0) { A.pop_back(); A.insert(A.end() - K,cur); } vector ans; ans.reserve(N); for(int i = 0;i < (int)B.size();i++) { ans.push_back(B[i]); } for(int i = 0;i < (int)A.size();i++) { ans.push_back(A[i]); } long long R = M - (long long)N * (N - 1) / 2; assert(R >= 0); for(int i = 0;i < N;i++) { if(ans[i] == N - 1) { ans[i] += R; } cout << ans[i] << "\n"; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; /* cin >> tt; */ while(tt--) Main(); }