#include <bits/stdc++.h>
using namespace std;
const int MX = 2e6 + 10;
const int mod = 1e9 + 7;
const long long int inf = 1LL << 62;
int dx4[] = {0, 0, -1, 1};
int dy4[] = {1, -1, 0, 0};
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[] = {1, 0, -1, 1, -1, 1, 0, -1};
int mark[200];
vector<long long int> v;
priority_queue<int> PQ;
int main() {
  long long int n, m, s, k, q, t, cnt = 0, sum = 0, ans = 0, mx = -inf,
                                  mn = inf, a, b, c, d, e, f, g, h, i, j, x, y,
                                  z, temp, temp1;
  string s1, s2, s3;
  cin >> n >> k >> s;
  if (((n - 1) * k) < s || s < k) {
    printf("NO\n");
    return 0;
  }
  a = n - 1;
  temp = 1;
  i = 1;
  while (s - a >= k) {
    if (temp == 1) {
      i += a;
      temp = 2;
    } else {
      i -= a;
      temp = 1;
    }
    v.push_back(i);
    s -= a;
    k--;
  }
  b = s - k + 1;
  printf("YES\n");
  if (temp == 1) {
    i += b;
    v.push_back(i);
    k--;
  } else {
    i -= b;
    v.push_back(i);
    k--;
  }
  ans = i + 1;
  sum = n - 1;
  temp = 1;
  while (k != 0) {
    k--;
    if (ans > n) {
      temp = 2;
      ans = 2;
      sum = n - 1;
    }
    if (sum == 0) {
      temp = 1;
      ans = 2;
      sum = n - 1;
    }
    if (temp == 1) {
      v.push_back(ans);
      ans++;
    } else {
      v.push_back(sum);
      sum--;
    }
  }
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
  return 0;
}
