#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  long long div = (s / k);
  long long rem = s % k;
  long long arr[k];
  for (int i = 0; i < k; i++) arr[i] = div;
  long long i = 0;
  while (rem > 0 && i < k) {
    arr[i] = min(arr[i] + rem, n - 1);
    rem -= (arr[i++] - div);
    if (arr[i] == 0) {
      cout << "NO";
      return 0;
    }
  }
  if (i >= k && rem > 0 || div == 0)
    cout << "NO";
  else {
    long long curr = 1;
    vector<int> ans;
    for (int i = 0; i < k; i++) {
      if (curr + arr[i] <= n) {
        curr = arr[i] + curr;
        ans.push_back(curr);
      } else if (curr - arr[i] >= 1) {
        curr = curr - arr[i];
        ans.push_back(curr);
      } else {
        cout << "NO";
        return 0;
      }
    }
    cout << "YES" << endl;
    for (int i = 0; i < k; i++) cout << ans[i] << " ";
  }
}
