#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void solveCP311() {
  ll n, k, s;
  cin >> n >> k >> s;
  ll MAX = n - 1;
  ll MIN = 1;
  if (MAX * k < s) {
    cout << "NO" << endl;
  } else if (MIN * k > s) {
    cout << "NO" << endl;
  } else {
    ll val = s / k;
    ll val2 = s % k;
    ll temp = 0;
    if (val2) temp = 1;
    cout << "YES" << endl;
    bool f1 = 0;
    ll curr = 1;
    while (k) {
      ll val = min(n - 1, s - (k - 1));
      if (f1) {
        cout << curr - val << " ";
        curr -= val;
        f1 = !f1;
      } else {
        cout << curr + val << " ";
        curr += val;
        f1 = !f1;
      }
      s = s - val;
      k--;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  while (t--) {
    solveCP311();
  }
  return 0;
}
