#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  long long int s;
  cin >> n >> k >> s;
  int d[300000];
  if ((long long int)(n - 1) * k < s || k > s) {
    cout << "NO";
    return 0;
  }
  long long int cnt = 0, maxwalk = n - 1, currentwalk = 0, currentposition = 1;
  while (cnt < k) {
    if (s - currentwalk - maxwalk < k - cnt - 1)
      maxwalk = s - currentwalk - k + cnt + 1;
    currentwalk += maxwalk;
    if (cnt % 2)
      currentposition -= maxwalk;
    else
      currentposition += maxwalk;
    d[cnt++] = currentposition;
  }
  cout << "YES" << endl;
  for (long long int i = 0; i < cnt; i++) cout << d[i] << ' ';
}
