#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
long long comp(long long a, long long b) { return (a > b); }
bool prime(long long n) {
  if (n == 0 or n == 1) return false;
  if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
long long binCo(long long n, long long r) {
  long long C[n + 1][r + 1];
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j <= min(i, r); j++) {
      if (j == 0 or j == i)
        C[i][j] = 1;
      else
        C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
    }
  }
  return C[n][r];
}
long long power(long long x, long long y, long long MODL) {
  long long res = 1;
  x = x % MODL;
  while (y > 0) {
    if (y & 1) res = (res * x) % MODL;
    y = y >> 1;
    x = (x * x) % MODL;
  }
  return res;
}
long long modInverse(long long a, long long m) { return power(a, m - 2, m); }
long long binSearch(long long arr[], long long n, long long x) {
  long long l = 0, r = n - 1;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (x == arr[mid]) return mid;
    if (x > arr[mid]) {
      l = mid + 1;
    } else if (x < arr[mid]) {
      r = mid - 1;
    }
  }
  return -1;
}
long long n, k, t;
void solve() {
  long long n, k, t;
  cin >> n >> k >> t;
  t = n * k * t / 100;
  while (n--) {
    cout << min(t, k) << " ", t -= min(t, k);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  solve();
  return 0;
}
