#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=998244353;
void solve() {
int n,k;
ll d;
cin >> n >> k >> d;
if(d<k || (n-1)*k<d) {cout << "NO\n"; return;}
cout << "YES\n";
vector<int> ans(k,1);
d-=k;
for(int i=0;i<k;i++){
ll v=min(d,(ll)n-2);
ans[i]+=v;
d-=v;
}
int curr=1;
for(int i=0;i<k;i++){
if((i+1)%2==1){
curr+=ans[i];
}
else
curr-=ans[i];
cout << curr << " ";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
/*int t;
cin >> t;
while (t--)*/ solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTk5ODI0NDM1MzsKCgp2b2lkIHNvbHZlKCkgewogICAgaW50IG4sazsKICAgIGxsIGQ7CiAgICBjaW4gPj4gbiA+PiBrID4+IGQ7CiAgICBpZihkPGsgfHwgKG4tMSkqazxkKSB7Y291dCA8PCAiTk9cbiI7IHJldHVybjt9CiAgICBjb3V0IDw8ICJZRVNcbiI7CiAgICB2ZWN0b3I8aW50PiBhbnMoaywxKTsKICAgIGQtPWs7CiAgICBmb3IoaW50IGk9MDtpPGs7aSsrKXsKICAgIAlsbCB2PW1pbihkLChsbCluLTIpOwogICAgICAgIGFuc1tpXSs9djsKICAgICAgICBkLT12OwogICAgfQogICAgaW50IGN1cnI9MTsKICAgIGZvcihpbnQgaT0wO2k8aztpKyspewogICAgICAgIGlmKChpKzEpJTI9PTEpewogICAgICAgICAgICBjdXJyKz1hbnNbaV07CiAgICAgICAgfQogICAgICAgIGVsc2UgCiAgICAgICAgICAgIGN1cnItPWFuc1tpXTsKICAgICAgICBjb3V0IDw8IGN1cnIgPDwgIiAiOyAgICAgCiAgICB9Cn0KCmludCBtYWluKCkgewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShudWxscHRyKTsKCQogICAgLyppbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkqLyBzb2x2ZSgpOwoKICAgIHJldHVybiAwOwp9Cg==