#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, t;
  cin >> n >> k >> t;
  int arr[n], s = 0, e = n * k, mid;
  memset(arr, 0, sizeof arr);
  while (s <= e) {
    mid = (s + e) / 2;
    if (mid * 100 <= n * k * t && n * k * t < 100 * (mid + 1))
      break;
    else if (mid * 100 > n * k * t)
      e = mid - 1;
    else
      s = mid + 1;
  }
  for (int i = 0; i < mid / k; i++) arr[i] = k;
  arr[mid / k] = mid % k;
  for (int i = 0; i < n; i++) cout << arr[i] << ' ';
  cout << endl;
  return 0;
}
