#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
const double pi = 2.0 * acos(0.0);
const double EPS = 1e-11;
long long sumDigit(long long n) {
  if (n == 0) return 0;
  return (n % 10 + sumDigit(n / 10));
}
long long _pow(long long n, long long mod) {
  if (n == 0) return 1;
  long long k = _pow(n / 2, mod);
  k = (k * k) % mod;
  if (n % 2) k = (k * 2) % mod;
  return k;
}
long long toNum(string s) {
  long long ret = 0, sig = 1, i = 0;
  if (!s.empty() && s[0] == '-') sig = -1, i++;
  while (i < s.size() && s[i] >= '0' && s[i] <= '9')
    ret = ret * 10 + (s[i++] - '0');
  return ret * sig;
}
string toStr(long long x) {
  string s = "";
  if (x == 0) return "0";
  while (x > 0) {
    s = (char)('0' + (x % 10)) + s;
    x /= 10;
  }
  return s;
}
long long a, b, c, d, e, f, n, test, ans;
long long check(long long x) {}
void solve(long long i) {}
void read() {
  long long n, k, s;
  cin >> n >> k >> s;
  a = 0;
  b = 1;
  if (k > s || (n - 1) * k < s) {
    cout << "NO" << endl;
    return;
  } else {
    cout << "YES" << endl;
    while (k--) {
      a = min(n - 1, s - k);
      s -= a;
      if (a + b <= n)
        b += a;
      else
        b -= a;
      cout << b << " ";
    }
    cout << endl;
  }
}
int main() { read(); }
