#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>,
                       greater<pair<int, int>>>
    rpqpi;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, s, mi, ma;
  cin >> n >> k >> s;
  mi = k;
  ma = k * (n - 1);
  if (s < mi || s > ma)
    cout << "NO\n";
  else {
    cout << "YES\n";
    long long now = 1, p;
    for (int i = 0; i < k; ++i) {
      p = (s + k - i - 1) / (k - i);
      if (i & 1) {
        now -= p;
      } else {
        now += p;
      }
      cout << now << " ";
      s -= p;
    }
  }
  return 0;
}
