#include <bits/stdc++.h>
const int M = 110;
int a[M];
int n, k, t;
int main() {
  while (scanf("%d%d%d", &n, &k, &t) == 3) {
    double c1, c2, c3;
    int n1, n2 = 0, cnt, cout;
    int i;
    n1 = n * k;
    c2 = (double)t / 100.0;
    cnt = t * n1 / 100 / k;
    n2 = cnt * k;
    c1 = (double)n2 / (double)n1;
    c3 = (double)(n2 + 1) / (double)n1;
    if (c1 <= c2 && c2 < c3) {
      for (i = 0; i < cnt; i++) printf("%d ", k);
      for (; i < n; i++) printf("0 ");
      printf("\n");
      continue;
    } else {
      int low = 1, high = k;
      while (low <= high) {
        int mid = (low + high) / 2;
        n2 += mid;
        c1 = (double)n2 / (double)n1;
        c3 = (double)(n2 + 1) / (double)n1;
        if (c1 <= c2 && c2 < c3) {
          cout = mid;
          break;
        }
        if (c1 <= c2) {
          if (c3 <= c2) {
            low = mid + 1;
            n2 -= mid;
          }
        } else {
          high = mid - 1;
          n2 -= mid;
        }
      }
    }
    for (i = 0; i < cnt; i++) printf("%d ", k);
    printf("%d ", cout);
    for (i = cnt + 1; i < n; i++) printf("0 ");
    printf("\n");
  }
  return 0;
}
