Codeforce Round #216 Div2 B

B. Valera and Contest

time limit per test 1 second

memory limit per test 256 megabytes

 

Valera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting of n students (including Valera). This contest was an individual competition, so each student in the team solved problems individually.

After the contest was over, Valera was interested in results. He found out that:

• each student in the team scored at least l points and at most r points;
• in total, all members of the team scored exactly s_all points;
• the total score of the k members of the team who scored the most points is equal to exactly s_k; more formally, if a₁, a₂, ..., a_n is the sequence of points earned by the team of students in the non-increasing order (a₁ ≥ a₂ ≥ ... ≥ a_n), then s_k = a₁ + a₂ + ... + a_k.

 

However, Valera did not find out exactly how many points each of n students scored. Valera asked you to recover any distribution of scores between the students of the team, such that all the conditions above are met.

Input

The first line of the input contains exactly six integers n, k, l, r, s_all, s_k (1 ≤ n, k, l, r ≤ 1000; l ≤ r; k ≤ n; 1 ≤ s_k ≤ s_all ≤ 10⁶).

It's guaranteed that the input is such that the answer exists.

Output

Print exactly n integers a₁, a₂, ..., a_n — the number of points each student scored. If there are multiple solutions, you can print any of them. You can print the distribution of points in any order.

Sample test(s)

Input

5 3 1 3 13 9

Output

2 3 2 3 3 

Input

5 3 1 3 15 9

Output

3 3 3 3 3 

#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <queue>

using namespace std;
#define INF 0x7fffffff
#define maxm 1001
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i = 0; i < (n); i++)
#define re return
#define fi first
#define se second
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define y0 y3487465
#define y1 y8687969
#define fill(x,y) memset(x,y,sizeof(x))

typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef double D;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef vector<vi> vvi;

template<class T> T abs(T x) { re x > 0 ? x : -x; }

const int maxn = 100015;

int n, m, t, k, x, l, r, s, sk;
int a[maxn], b[maxn];

int main(){
    scanf("%d%d%d%d%d%d", &n, &k, &l, &r, &s, &sk);
    int ans = s / n;
    t = s - (ans*n);
    for (int i = 0; i < n; i++)a[i] = ans;
    for (int i = 0; i < t; i++)a[i]++;
    int sum = 0;
    for (int i = 0; i < k; i++)sum += a[i];
    if (sum != sk){
        sum = sk - sum;
        t = sum / k;
        for (int i = 0; i < k; i++)a[i] += t;
        t = sum - t*k;
        for (int i = k - 1; i >= k - t; i--)a[i]++;
        t = sum / (n - k);
        for (int i = k; i < n; i++)a[i] -= t;
        t = sum - t*(n - k);
        for (int i = k; i < k+t; i++)a[i]--;
    }
    for (int i = 0; i < n; i++)printf("%d ", a[i]);
    return 0;
}