#include <bits/stdc++.h>
using namespace std;
template <class T>
const T& max(const T& a, const T& b, const T& c) {
  return max(a, max(b, c));
}
template <class T>
const T& min(const T& a, const T& b, const T& c) {
  return min(a, min(b, c));
}
struct sp {
  bool operator()(const pair<string, int>& a, const pair<string, int>& b) {
    if (a.second != b.second) {
      return (a.second > b.second);
    }
    return (a.first < b.first);
  }
};
long long stoi(string& str) {
  istringstream second(str);
  long long i;
  second >> i;
  return i;
}
string itos(long long i) {
  stringstream second;
  second << i;
  return second.str();
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long poww(long long a, long long b) {
  long long res = 1;
  for (int i = 1; i <= b; i++) res *= a;
  return res;
}
long long sumOfDigs(string s) {
  long long sum = 0;
  for (int i = 0; i < s.length(); i++) sum += s[i] - '0';
  return sum;
}
long long mod = 1000000007;
using namespace std;
int a[1001][101];
int b[1001][101];
set<pair<int, int> > used;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n, k, t;
  cin >> n >> k >> t;
  int a = (t * n * k) / 100 - 1;
  int b = (n * k * t) / 100;
  int x = 0, c = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      if ((k * (i - 1) + j) >= a && (k * (i - 1) + j) <= b) {
        x = i, c = j;
      }
    }
  }
  for (int i = 1; i <= x - 1; i++) cout << k << " ";
  cout << c << " ";
  for (int i = x + 1; i <= n; i++) cout << 0 << " ";
  return 0;
}
