#include <bits/stdc++.h>

using namespace std;

const int N = 1000010;
const __int128 INF = 1e18 + 69;

int n, m; long long k, power[N];
vector <int> two[] = {{1, 1, 2, 1, 2, 2}, {1, 1, 2, 2, 1, 2}, {1, 2, 1, 1, 2, 2}, {1, 2, 1, 2, 2, 1}, {1, 2, 2, 1, 1, 2}, {1, 2, 2, 1, 2, 1}, {2, 1, 1, 2, 1, 2}, {2, 1, 1, 2, 2, 1}, {2, 1, 2, 1, 1, 2}, {2, 1, 2, 2, 1, 1}, {2, 2, 1, 1, 2, 1}, {2, 2, 1, 2, 1, 1}};

int main() {
  cin >> n >> m >> k;
  if (n == 1) {
    if (k > m) puts("-1");
    else printf("%lld\n", k);
    return 0;
  }
  if (m == 1) {
    if (k > 1) {
      puts("-1");
    } else {
      for (int i = 1; i <= n; ++i) printf("1 ");
      puts(""); 
    }
    return 0;
  }
  if (n == 2) {
    long long total = (long long) m * (m - 1);
    if (total < k) {
      puts("-1");
    } else {
      long long A = (k + m - 2) / (m - 1);
      k -= (A - 1) * (m - 1);
      long long B = k;
      if (B >= A) ++B;
      printf("%lld %lld\n", A, B);
    }
    return 0;
  }
  if (m == 2) {
    if (n <= 6) {
      vector <vector <int>> who;
      for (int i = 0; i < 12; ++i) {
        who.emplace_back(two[i].begin(), two[i].begin() + n);
      }
      who.erase(unique(who.begin(), who.end()), who.end());
      if (k > who.size()) {
        puts("-1");
      } else {
        for (int x : who[k - 1]) printf("%d ", x); 
        puts("");
      }
    } else {
      if (k > 12) {
        puts("-1");
      } else {
        for (int i = 0; i < n; ++i) printf("%d ", two[k - 1][i % 6]);
        puts("");
      }
    }
    return 0;
  }
  if (m == 3) {
    if (k > 6) {
      puts("-1");
    } else {
      vector <int> vec({1, 2, 3});
      for (int i = 1; i < k; ++i) next_permutation(vec.begin(), vec.end());
      for (int i = 0; i < n; ++i) printf("%d ", vec[i % 3]);
      puts("");
    }
    return 0;
  }
  power[0] = 1;
  for (int i = 1; i < N; ++i) {
    power[i] = min(INF, (__int128) power[i - 1] * (m - 2)); 
  }
  __int128 total = min(INF, (__int128) power[n - 2] * m * (m - 1));
  if (total < k) {
    puts("-1");
    return 0;
  }
  int last = m + 1, prevLast = m + 1;
  for (int i = 1; i <= n; ++i) {
    __int128 each = i == 1 ? min(INF, (__int128) power[n - 2] * (m - 1)) : power[n - i];
    int cur = (k + each - 1) / each;
    k -= (cur - 1) * each;
    if (last <= cur) ++cur;
    if (prevLast <= cur) ++cur;
    printf("%d ", cur);
    swap(last, prevLast), last = cur;
  }
  puts("");
  return 0;
}