#include <bits/stdc++.h>
const long long maxN = 2e9 + 10;
using namespace std;
long long Step(long long cur, long long x) {
  if (cur > x)
    return cur - x;
  else
    return cur + x;
}
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  long long step = (s + (n - 2)) / (n - 1);
  if (k < step or s < k) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  long long cur = 1;
  while (k > 0) {
    long long l = min(n - 1, s - (k - 1));
    cur = Step(cur, l);
    cout << cur << " ";
    s -= l;
    k--;
  }
  cout << endl;
}
