func_code_string: #include <bits/stdc++.h>   const long double eps = 1e-9;   const long long mod = 1e9 + 7, ll_max = (long long)1e18;   const int MX = 2e5 + 10, int_max = 0x3f3f3f3f;   using namespace std;   mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());   long long n, k;   long long arr[MX];   int solve() {     cin >> n >> k;     for (int i = 0; i < k; i++) {       arr[i] += i + 1;       n -= i + 1;     }     if (n < 0) return 0;     for (int i = 0; i < k; i++) {       arr[i] += (n / k);     }     n %= k;     for (int i = k - 1; i > 0; i--) {       int del = min(2 * arr[i - 1] - arr[i], n);       n -= del;       arr[i] += del;     }     return (n == 0);   }   int main() {     cin.tie(0)->sync_with_stdio(0);     if (solve()) {       cout <<  YES n ;       for (int i = 0; i < k; i++) cout << arr[i] <<    ;       cout <<   n ;     } else {       cout <<  NO n ;     }     return 0;   }   