#include <bits/stdc++.h>
using namespace std;
void OJ();
int arr[109], cnt;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  OJ();
  int n, k, t;
  cin >> n >> k >> t;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= k; ++j) {
      arr[i] = j;
      cnt = k * (i - 1) + j;
      long double a = (1.0 * cnt) / (1.0 * n * k);
      long double c = ((1.0 * cnt) + 1) / (1.0 * n * k);
      long double b = (1.0 * t) / 100.0;
      if (b >= a && b < c && b > 0.0) {
        for (int k = 1; k <= n; ++k) {
          cout << arr[k] << " ";
        }
        return 0;
      }
    }
  }
  for (int k = 1; k <= n; ++k) {
    cout << 0 << " ";
  }
  return 0;
}
void OJ() {}
long long binEXP(long long x, long long pw, long long MOD) {
  long long res = 1;
  while (pw > 0) {
    pw % 2 ? res *= x : 0;
    x *= x;
    x %= MOD;
    pw /= 2;
    res %= MOD;
  }
  return res %= MOD;
}
