func_code_string: #include <bits/stdc++.h>   using namespace std;   long long mod = 1e9 + 7;   int n, k, maxn = 2000000001;   int b[100001];   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     cin >> n >> k;     for (int i = 0; i < k; i++) {       int r = (n - (k - i) * (k - i - 1) / 2) / (k - i);       if (r <= 0) {         cout <<  NO ;         return 0;       }       if (r > maxn) {         b[i] = maxn;         n -= maxn;         maxn = maxn * 2;       } else {         b[i] = r;         n -= r;         maxn = r * 2;       }       if (i == k - 1 && n != 0) {         cout <<  NO ;         return 0;       }     }     cout <<  YES  << endl;     for (int i = 0; i < k; i++) cout << b[i] <<    ;     return 0;   }   