#include <cassert> #include <cctype> #include <cfloat> #include <climits> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <cfenv> #include <cinttypes> #include <cstdint> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <chrono> #include <forward_list> #include <initializer_list> #include <random> #include <ratio> #include <regex> #include <system_error> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <shared_mutex> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; constexpr ll INF = 2e18; constexpr int inf = 2e8; //ライブラリを貼るところ //ここまで vector<ll> ans; int t = 0; void f(ll cur, ll i){ if(t == 1) return; if(cur == 0){ for(auto N: ans) cout << N << " "; cout << "\n"; t = 1; return; } if(i == 0) return; int p = i; ll g = 1; while(g <= cur){ ++p; g *= p; g /= p - i; } for(int j = p; j > i; --j){ g *= j - i; g /= j; if(ans.size() != 0) if(ans[ans.size() - 1] <= j - 1) continue; ans.push_back(j - 1); f(cur - g, i - 1); ans.pop_back(); } } void solve(){ ll N; cin >> N; int i; cin >> i; if(i == 1){ cout << N << "\n"; return; } f(N, i); } int main(void){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(16) << fixed; int T = 1; for(int i = 0; i < T; ++i) solve(); }