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

You have to perform k 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 s 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 k 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 k integers h_i (1 ≤ h_i ≤ n) on the second line, where h_i is the house you visit on the i-th move.

For each j from 1 to k-1 the following condition should be satisfied: h_j ≠ h_{j + 1}. Also h_1 ≠ 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

Solution (in JAVA):

Solution:


import java.util.Scanner;

public class DWalkingBetweenHouses {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        long n = scan.nextLong(), k = scan.nextLong(), s = scan.nextLong();

        newWay(n, k, s);
//        oldWay(n, k, s);

    }

    /**
     * 假设k步中每步都是走1步,然后往上面加步数的方案,思路清晰巧妙,代码简短
     *
     * @param n n
     * @param k k
     * @param s s
     */
    private static void newWay(long n, long k, long s) {
        //先判断是否需要打印NO
        long divideAns = s / (n - 1);
        long remainder = s % (n - 1);
        if (divideAns + (remainder > 0 ? 1 : 0) > k || k > s) {
            System.out.println("NO");
            return;
        }
        //开始
        System.out.println("YES");
        //默认先分配好k个1步
        s -= k;
        int cur = 1;
        long step;
        while (k > 0) {
            //当n-1>剩余步伐时,走最长路
            step = Math.min(s, n - 2);
//            System.out.printf("s:%d,step:%d\n",s, step);
            if (cur + step + 1 <= n) {
                cur += step + 1;
            } else if (cur - step - 1 > 0) {
                cur -= step + 1;
            }
            //1.因为事前先分配好一步,所以实际s减少量为step-1
            //2.当s=1时,将不会再减少,也就是步伐保持1
            s -= step;
            System.out.print(cur + " ");
            k--;
        }
    }

    /**
     * 使用除法与余数推敲该走的步
     *
     * @param n n
     * @param k k
     * @param s s
     */
    public static void oldWay(long n, long k, long s) {
        long divideAns = s / (n - 1);
        long remainder = s % (n - 1);

        if (divideAns + (remainder > 0 ? 1 : 0) > k || k > s) {
            System.out.println("NO");
            return;
        }
        System.out.println("YES");
        while (remainder < (k - divideAns)) {
            divideAns--;
            remainder += n - 1;
        }
        long cur = 1;
        while (divideAns > 0) {
            cur = n - cur + 1;
            System.out.print(cur + " ");
            divideAns--;
            k--;
        }
        long extraStep = 0, stepDis = 0;
        if (k > 0) {
            extraStep = remainder % k;
            stepDis = remainder / k;
        }
        while (k > 0) {
            long nextStepDis = (stepDis < remainder ? stepDis : remainder) + (extraStep > 0 ? 1 : 0);
            extraStep--;
            if (cur + nextStepDis <= n) {
                cur += nextStepDis;
                remainder -= nextStepDis;
            } else if (cur - nextStepDis > 0) {
                cur -= nextStepDis;
                remainder -= nextStepDis;
            }
            k--;
            System.out.print(cur + " ");
        }
    }

}