#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL maxn = 100100;
LL n, k, s;
signed main() {
  while (~scanf("%lld%lld%lld", &n, &k, &s)) {
    LL tot = (n - 1) * k;
    if (tot < s) {
      printf("NO\n");
      continue;
    }
    if (k > s) {
      printf("NO\n");
      continue;
    }
    LL cur = 1;
    vector<LL> ret;
    while (k) {
      LL t = min(n - 1, s - (k - 1));
      cur = cur - t > 0 ? cur - t : cur + t;
      s -= t;
      k--;
      ret.push_back(cur);
    }
    printf("YES\n");
    for (int i = 0; i < ret.size(); i++) {
      printf("%lld%c", ret[i], " \n"[i == ret.size() - 1]);
    }
  }
  return 0;
}
