#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = INF * (long long)INF;
const int MAX = 1000 + 47;
const int MOD = 1000 * 1000 * 1000 + 7;
int A[MAX];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, t;
  cin >> n >> k >> t;
  int val = 0;
  bool hasAns = false;
  for (int i = (0); i < (n); i++) {
    for (int j = (0); j < (k + 1); j++) {
      if (val * 100 <= t * n * k && t * n * k < (val + 1) * 100) {
        hasAns = true;
        break;
      }
      if (j == k) break;
      A[i]++;
      val++;
    }
    if (hasAns) break;
  }
  for (int i = (0); i < (n); i++) cout << A[i] << " ";
  cout << endl;
}
