func_code_string: #include <bits/stdc++.h>   using namespace std;   long long int power(long long int a, long long int b) {     if (b == 0) return 1;     if (b == 1) return a;     long long int r = power(a, b / 2) % 1000000007;     if (b % 2 == 0)       return (r * r) % 1000000007;     else       return (((r * r) % 1000000007) * a) % 1000000007;   }   int prime[1000009];   int sumprime[1000009];   void sieve(int n) {     prime[0] = prime[1] = 1;     for (int i = 2; i <= sqrt(n); i++) {       if (!prime[i]) {         for (int j = 2 * i; j <= n; j = j + i) {           prime[j]++;         }       }     }     for (int i = 1; i <= n; i++) {       if (!prime[i]) {         sumprime[i] = sumprime[i - 1] + 1;       } else {         sumprime[i] = sumprime[i - 1];       }     }   }   bool comp(const pair<long double, long long int> &a,             const pair<long double, long long int> &b) {     if (a.first == b.first) return a.second < b.second;     return (a.first < b.first);   }   const int N = 5 * 1e5 + 9;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long int m, n;     cin >> n >> m;     vector<pair<long double, long long int>> v;     for (int i = 1; i <= m; i++) {       long double d = abs((m + 1) / 2.0 - i);       v.push_back({d, i});     }     sort(v.begin(), v.end(), comp);     for (int i = 0; i < n; i++) {       int val = i % m;       cout << v[val].second <<   n ;     }     return 0;   }   