#include <bits/stdc++.h>
using namespace std;
long long mod_v(long long num) {
  if (num >= 0)
    return (num % 1000000007);
  else
    return (num % 1000000007 + 1000000007) % 1000000007;
}
long long bigmod(long long b, long long p, long long m) {
  long long res = 1 % m, x = b % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
int countBits(int n) {
  int sum = 0;
  while (n > 0) {
    if (n & 1 == 1) sum++;
    n = n >> 1;
  }
  return sum;
}
long long gcd(long long a, long long b) {
  a = abs(a);
  b = abs(b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
int arr[110] = {0};
int main() {
  int n, k, t, x, a, b, c;
  cin >> n >> k >> t;
  x = n * k * t;
  bool get = false;
  for (int j = 1; j <= n && !get; j++) {
    c = 100 * ((j - 1 - 0) * k + (n - j - 1) * 0);
    for (int i = 0; i <= k; i++) {
      a = c + i * 100;
      b = a + 100;
      if (x >= a && x < b) {
        for (int l = 1; l < j; l++) arr[l] = k;
        arr[j] = i;
        for (int l = j + 1; l <= n; l++) arr[l] = 0;
        get = true;
        break;
      }
    }
  }
  for (int l = 1; l < n; l++) printf("%d ", arr[l]);
  printf("%d\n", arr[n]);
  return 0;
}
