#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e7 + 7;
const long long mo = 1e9 + 7;
long long n, m, k, p, q, r, mod, i, j, d = 0, ans;
long long wz;
int main() {
  scanf("%lld %lld %lld", &n, &m, &k);
  r = n - 1;
  ans = r * m;
  wz = 1;
  if (ans < k || m > k)
    printf("NO\n");
  else {
    printf("YES\n");
    while (k - r > m - 1) {
      if (d == 0)
        wz = n;
      else
        wz = 1;
      printf("%lld ", wz);
      k -= r;
      d ^= 1;
      m--;
    }
    p = k - m + 1;
    if (m > 0 && p != 0) {
      m--;
      if (d == 0)
        wz = wz + p;
      else
        wz = wz - p;
      printf("%lld ", wz);
      d ^= 1;
    }
    while (m--) {
      if (d == 0)
        wz = wz + 1;
      else
        wz = wz - 1;
      printf("%lld ", wz);
      d ^= 1;
    }
  }
  return 0;
}
