CF369B.Valera and Contest

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_1, _a_2, ..., a__n is the sequence of points earned by the team of students in the non-increasing order (_a_1 ≥ _a_2 ≥ ... ≥ a__n), then s__k = _a_1 + _a_2 + ... + 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.

瓦莱拉热衷于参加各类竞赛，尤其是编程竞赛。今天，他与一支由 $n$ 名学生（包括瓦莱拉本人）组成的队伍参加了比赛。本次比赛为个人赛，因此队伍中的每名学生均独立解题。

比赛结束后，瓦莱拉对成绩产生了兴趣。他了解到以下信息：

• 队伍中每名学生的得分均不少于 $l$ 分，且不多于 $r$ 分；
• 队伍所有成员的总得分为恰好 $s_{\text{all}}$ 分；
• 队伍中得分最高的 $k$ 名学生的得分之和恰好为 $s_k$；更准确地说，若 $a_1,\,a_2,\,\dots,\,a_n$ 表示该学生队伍按非递增顺序排列的得分序列（即 $a_1 \ge a_2 \ge \dots \ge a_n$），则有 $s_k = a_1 + a_2 + \dots + a_k$。

然而，瓦莱拉并未获知这 $n$ 名学生各自的具体得分。他请你重构出任意一种满足上述所有条件的学生得分分配方案。

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 ≤ 106).

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

输入的第一行恰好包含六个整数 $n$、$k$、$l$、$r$、$s_{\text{all}}$、$s_k$（其中 $1 \leq n, k, l, r \leq 1000$；$l \leq r$；$k \leq n$；$1 \leq s_k \leq s_{\text{all}} \leq 10^6$）。

保证输入数据满足答案一定存在。

Print exactly n integers _a_1, _a_2, ..., 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.

精确输出 $n$ 个整数 $a_1,\,a_2,\,\dots,\,a_n$ —— 每位学生所得的分数。若存在多种解，输出任意一种即可。分数的分配顺序可以任意。