Histogram Sequence 4

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

You had a histogram made of NN axis-parallel rectangles sharing a common baseline: the ii-th rectangle from the left had a width 11 and an integer height H_iH\_i.

Sadly, you lost your histogram! Moreover, you even forgot what your histogram looked like — the heights of the rectangles of the histogram. What you remember is the maximum area AA of the axis-parallel rectangle inside the histogram, and the fact that LH_iRL\le H\_i\le R for every H_iH\_i.

Your goal is to recover the histogram by finding any histogram satisfying all the requirements that you remember. As your memory might not be perfect, there may be no histogram satisfying the requirements.

입력

The first and only line contains four space-separated integers, NN, AA, LL, RR.

출력

If there is no histogram satisfying the requirements, output NO.

Otherwise, output YES in the first line. In the second line, output NN integers in a single line, where the ii-th value is the height H_iH\_i of the ii-th rectangle. If there are multiple answers, print any.

제한

  • 1N500,0001\le N\le 500\\, 000
  • 0A10180\le A\le 10^{18}
  • 0LR10180\le L\le R\le 10^{18}

힌트

A histogram with heights 3,7,6,8,5,53,7,6,8,5,5 is shown below. The maximum area rectangle inside the histogram has an area of 2525.