#include <bits/stdc++.h>   using namespace std;   int main() {     int n, k, l, r, sall, sk;     cin >> n >> k >> l >> r >> sall >> sk;     int el[n];     int div, mod, m, sm;     m = n - k;     sm = sall - sk;     if (k > 0) {       div = sk / k;       mod = sk % k;       for (int i = 0; i < k; i++) {         el[i] = div;         if (i < mod) {           el[i] += 1;         }       }     }     if (m > 0) {       div = sm / m;       mod = sm % m;       for (int i = 0; i < m; i++) {         el[i + k] = div;         if (i < mod) {           el[i + k] += 1;         }       }     }     for (int i = 0; i < n; i++) {       cout << el[i] <<    ;     }   }   