CodeForces - 1015D

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

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 xx to the house yy, the total distance you walked increases by |x−y||x−y| units of distance, where |a||a| is the absolute value of aa. 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 nn, kk, ss (2≤n≤1092≤n≤109, 1≤k≤2⋅1051≤k≤2⋅105, 1≤s≤10181≤s≤1018) — the number of houses, the number of moves and the total distance you want to walk.

Output

If you cannot perform kk moves with total walking distance equal to ss, print "NO".

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

For each jj from 11 to k−1k−1 the following condition should be satisfied: hj≠hj+1hj≠hj+1. Also h1≠1h1≠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

刚一碰到题，头有点大，感觉有很多需要判断的条件，但是仔细缕一缕发现，其实需要判的条件并不多。

 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<stack>
 #include<deque>
 #include<map>
 #include<iostream>
 using namespace std;
 typedef long long  LL;
 const double pi=acos(-1.0);
 const double e=exp();
 const int N = ;

 #define lson i << 1,l,m
 #define rson i << 1 | 1,m + 1,r

 int main()
 {
     LL n,k,s;
     LL i,j,x,y,p;
     scanf("%lld%lld%lld",&n,&k,&s);
     p=;
     if(k>s||(n-)*k<s)
         printf("NO\n");
     else
     {
         printf("YES\n");
         x=s/k;
         y=s%k;
         for(i=; i<=k; i++)
         {
             LL mid=x;
             if(y>)
             {
                 mid+=;
                 y--;
             }
             if(p+mid>n)
                 p=p-mid;
             else
                 p=p+mid;
             printf("%lld ",p);
         }
     }
     return ;
 }