#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5, L = 14, OO = INT_MAX;
const long long M = 1000000007;
const double ESP = 1e-8;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long n, k, s;
  cin >> n >> k >> s;
  vector<long long> ans(k);
  for (int i = 0; i < k; i++) ans[i] = 0;
  long long mx = n - 1;
  int idx = 0;
  long long lst;
  if (s < k || k * mx < s) {
    cout << "NO\n";
    return 0;
  }
  while (1) {
    if (s - mx > 0) {
      s -= mx;
      ans[idx++] = mx;
    } else {
      ans[idx++] = s;
      break;
    }
  }
  cout << "YES\n";
  int idx2 = 0;
  while (idx < k) {
    if (ans[idx2] == 1) idx2++;
    ans[idx++] = 1;
    ans[idx2]--;
  }
  long long st = 1;
  sort(ans.begin(), ans.end(), greater<long long>());
  for (int i = 0; i < idx; i++) {
    if (st + ans[i] <= n)
      st += ans[i];
    else
      st -= ans[i];
    cout << st << " ";
  }
}
