#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; };
long long mod(long long a, long long b) { return (a + b - 1) / b; };
long long month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);
  long long n, k, sum;
  cin >> n >> k >> sum;
  if (n >= k) {
    for (long long(i) = 0; i < (k); i++) {
      if (i) cout << " ";
      cout << sum;
    }
    for (long long(i) = 0; i < (n - k); i++) cout << " " << sum + 2;
    cout << endl;
    return 0;
  }
  long long mid1 = 1;
  for (long long i = 1; i <= sqrt(k); i++) {
    if (k % i == 0) {
      chmax(mid1, i);
    }
  }
  long long mid2 = k / mid1;
  long long val1, val2;
  if (sum % 2 == 0) {
    val1 = (sum / 2) - 1;
    val2 = (sum / 2) + 1;
  } else {
    val1 = sum / 2;
    val2 = sum - val1;
  }
  cout << mid1 << " " << mid2 << endl;
  cout << val1 << " " << val2 << endl;
  for (long long(i) = 0; i < (mid1); i++) {
    if (i) cout << " ";
    cout << val1;
  }
  for (long long(i) = 0; i < (mid2); i++) {
    cout << " " << val2;
  }
  cout << endl;
  return 0;
}
