Codeforces Round #501 (Div. 3) D. Walking Between Houses

Problem Description

There are n houses in a row. They are numbered from 1 to nn in order from left to right. Initially you are in the house 1.

You have to perform kk moves to other house. In one move you go from your current house to some other house. You can’t stay where you are (i.e., in each move the new house differs from the current house). If you go from the house x to the house y, the total distance you walked increases by |x−y| units of distance, where |a| is the absolute value of a. It is possible to visit the same house multiple times (but you can’t visit the same house in sequence).

Your goal is to walk exactly ss units of distance in total.

If it is impossible, print “NO”. Otherwise print “YES” and any of the ways to do that. Remember that you should do exactly kk moves.

Input

The first line of the input contains three integers n, k, s (2≤n≤10^9, 1≤k≤2⋅10^5, 1≤s≤10^18) — the number of houses, the number of moves and the total distance you want to walk.

Output

If you cannot perform k moves with total walking distance equal to s, print “NO”.

Otherwise print “YES” on the first line and then print exactly kk integers hi (1≤hi≤n) on the second line, where hi is the house you visit on the i-th move.

For each j from 1 to k−1 the following condition should be satisfied: hj≠hj+1. Also h1≠1 should be satisfied.

Examples

Input

10 2 15

Output

YES
10 4

Input

10 9 45

Output

YES
10 1 10 1 2 1 2 1 6

Input

10 9 81

Output

YES
10 1 10 1 10 1 10 1 10

Input

10 9 82

Output

NO

题意：
在一条数轴上从从1～n排列着n座房子，每次必须移动，移动的距离为两点坐标之差的绝对值，问能否在k回合里一共移动s距离。
思路：
(看了大佬的博客赶紧把学到的思路记录下来了，hahahaha)
首先判断NO的情况，一种是每次走最大距离，走k次还是小于s。还有一种是每次走最小距离(也就是１），走k次还是大于s。然后分析YES的情况，将s平均分成k份，如果有剩余，就将剩余的分给平均值。例如：s=8,k=3，平均值为２，所以一共分成３个２，剩下２步没有走，就将剩下的２分成两个１加到平均值，所以可分成２ ３ ３。这样就能保证在k步累计s距离。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
int main()
{
    ll n,k,s;
    vector<ll> v;
    cin>>n>>k>>s;

    ll  Max=k*(n-1);//最大距离
    if(Max<s||s<k)//最大距离小于要求距离或k步走的路程大于要求路程
    {
        cout<<"NO"<<endl;
        return 0;
    }

    ll ave=s/k;//分成k份
    ll left=s%k;

    for(ll i=0;i<left;i++)
        v.push_back(ave+1);

    for(ll  i=0;i<k-left;i++)
        v.push_back(ave);

    ll  step=1;
    cout<<"YES"<<endl;

    for(ll  i=0;i<v.size();i++)
    {
        if(step+v[i]<=n)//每次加约定的步数
        {
            cout<<step+v[i]<<" ";
            step+=v[i];
        }
        else//超出了范围就往回走
        {
            cout<<step-v[i]<<" ";
            step-=v[i];
        }
    }
    cout<<endl;

    return 0;
}