https://codeforces.com/contest/1015/problem/D

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG

using namespace std;
typedef long long ll;
const int N=10000;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
ll t,n,m,k;
ll s;


int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    while(scanf("%I64d%I64d%I64d",&n,&k,&s)!=EOF){
        if((n-1)*k<s||k>s){
            cout << "NO" << endl;
            continue;
            return 0;
        }
        cout << "YES" << endl;
        int pos=1;
        while(k>0){
            int l = min(n - 1, s - (k - 1));
            if(pos-l>0){
                pos-=l;
            }else{
                pos+=l;
            }
            printf("%d ",pos);
            s -= l;
            k -= 1;

        }
        cout<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}