#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
void mad(long long int &a, long long int b) {
  a = (a + b) % 1000000007;
  if (a < 0) a += 1000000007;
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool cmp(string a, string b) { return a.length() < b.length(); }
int isSubstring(string s1, string s2) {
  int M = s1.length();
  int N = s2.length();
  for (int i = 0; i <= N - M; i++) {
    int j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
bool cmp(vector<long long int> v, vector<long long int> v1) {
  return v.size() < v1.size();
}
long long int check(long long int a,
                    vector<pair<long long int, long long int>> v) {
  long long int str = 0;
  long long int end = v.size() - 1;
  while (str <= end) {
    long long int mid = (str + end) / 2;
    if (v[mid].first == a) {
      return v[mid].second;
    } else if (v[mid].first > a) {
      str = mid + 1;
    } else if (v[mid].first < a) {
      end = mid - 1;
    }
  }
  return -1;
}
bool cmp1(pair<long long int, long long int> a,
          pair<long long int, long long int> b) {
  return a.first > b.first;
}
void solve1() {
  long long int n, k, s;
  cin >> n >> k >> s;
  if (k * (n - 1) < s || s < k) {
    cout << "NO"
         << "\n";
    return;
  } else {
    long long int req = s / k;
    long long int rem = s % k;
    long long int z = rem / k;
    long long int z1 = rem % k;
    long long int extra = 0;
    req += z;
    long long int count = 0;
    long long int curr = 1;
    vector<long long int> v, v1;
    while (count < z1) {
      v1.push_back(req + 1);
      count++;
    }
    while (count < k) {
      v1.push_back(req);
      count++;
    }
    for (int i = 0; i < k; i++) {
      if (curr - v1[i] < 1) {
        curr += v1[i];
      } else {
        curr -= v1[i];
      }
      v.push_back(curr);
    }
    cout << "YES"
         << "\n";
    for (auto it : v) {
      cout << it << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  for (int i = 0; i < t; i++) {
    solve1();
  }
  return 0;
}
