#include <bits/stdc++.h>
using namespace std;
int pos = 1;
long long s, done, n, k;
vector<int> v;
int main() {
  cin >> n >> k >> s;
  if (n * k - k < s || k > s) {
    cout << "NO";
    return 0;
  }
  while (k > 0) {
    if (done + n + k - 2 > s) {
      break;
    }
    if (pos == 1) {
      pos = n;
      v.push_back(n);
      done += n - 1;
      k--;
    } else {
      pos = 1;
      v.push_back(1);
      done += n - 1;
      k--;
    }
  }
  if (done + k < s) {
    long long a = s - done - k + 1;
    if (pos == 1) {
      pos += a;
      v.push_back(pos);
      k--;
    } else {
      pos -= a;
      v.push_back(pos);
      k--;
    }
  }
  for (int i = 1; i <= k; i++) {
    if (pos < n) {
      pos++;
      v.push_back(pos);
    } else {
      pos--;
      v.push_back(pos);
    }
  }
  cout << "YES"
       << "\n";
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
}
