#include <bits/stdc++.h>
using namespace std;
void solve() {}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k, s;
  cin >> n >> k >> s;
  if (s < k || s > (n - 1) * k) {
    cout << "NO" << endl;
    return 0;
  }
  vector<long long> dist;
  long long mx = (n - 1);
  for (long long i = 1; i <= k; i++) {
    long long rem = (k - i);
    long long to_take = min(s - rem, mx);
    dist.push_back(to_take);
    s -= to_take;
  }
  vector<long long> ans;
  ans.push_back(1);
  if (s == 0) {
    cout << "YES" << endl;
    for (long long i = 0; i < k; i++) {
      if (ans.back() + dist[i] <= n) {
        long long x = ans.back() + dist[i];
        cout << x << " ";
        ans.push_back(x);
      } else if (ans.back() - dist[i] >= 1) {
        long long x = ans.back() - dist[i];
        cout << x << " ";
        ans.push_back(x);
      }
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
