A progress bar is an element of graphical interface that displays the progress of a process for this very moment before it is completed. Let's take a look at the following form of such a bar.

A bar is represented as n squares, located in line. To add clarity, let's number them with positive integers from 1 to n from the left to the right. Each square has saturation (ai for the i-th square), which is measured by an integer from 0 to k. When the bar for some i (1 ≤ i ≤ n) is displayed, squares 1, 2, ... , i - 1 has the saturation k, squares i + 1, i + 2, ... , n has the saturation 0, and the saturation of the square i can have any value from 0 to k.

So some first squares of the progress bar always have the saturation k. Some last squares always have the saturation 0. And there is no more than one square that has the saturation different from 0 and k.

The degree of the process's completion is measured in percents. Let the process be t% completed. Then the following inequation is fulfilled: 

<image>

An example of such a bar can be seen on the picture.

<image>

For the given n, k, t determine the measures of saturation for all the squares ai of the progress bar.

Input

We are given 3 space-separated integers n, k, t (1 ≤ n, k ≤ 100, 0 ≤ t ≤ 100).

Output

Print n numbers. The i-th of them should be equal to ai.

Examples

Input

10 10 54


Output

10 10 10 10 10 4 0 0 0 0 

Input

11 13 37


Output

13 13 13 13 0 0 0 0 0 0 0 
import java.io.*;
import java.util.*;
import java.math.*;

import static java.lang.Math.*;

public class Main implements Runnable {

    StreamTokenizer in;
    BufferedReader reader;
    PrintWriter out;
    StringTokenizer tok;
    Scanner sc;
    boolean timus = System.getProperty("ONLINE_JUDGE")!=null;
    boolean codeforces = true;
    final double eps = 1e-9;
    
    public static void main(String[] args) throws Exception {
        new Thread(new Main()).start();
    }
    
    @Override
    public void run() {
        try {
            if (codeforces) {
                sc = new Scanner(System.in);
                reader = new BufferedReader(new InputStreamReader(System.in));
                in = new StreamTokenizer(reader);
                out= new PrintWriter (new OutputStreamWriter(System.out));
                tok = new StringTokenizer("");
                solve();
                out.flush();
            } else
                if (timus) {
                    sc = new Scanner("input.txt");
                    reader = new BufferedReader(new FileReader("input.txt"));
                    in = new StreamTokenizer(reader);
                    out= new PrintWriter (new FileWriter("output.txt"));
                    tok = new StringTokenizer("");
                    solve();
                    out.flush();
                    out.close();
                } else
                    if (!timus) {
                long begMem = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
                long t1 = System.currentTimeMillis();
                reader = new BufferedReader(new InputStreamReader(System.in));
                in = new StreamTokenizer(reader);
                sc = new Scanner(System.in);
                out= new PrintWriter (new OutputStreamWriter(System.out));
                tok = new StringTokenizer("");
                solve();
                long endMem = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
                out.flush();
                long t2 = System.currentTimeMillis();
                System.out.println("Time:"+(t2-t1));
                System.out.println("Memory:"+(endMem-begMem));
                System.out.println("Total memory: " + (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()));
            }
        }
        catch (Exception ex) {
            System.out.println("fail");
            System.exit(1);
        }
    }
    
    public class Chess {
        String coord;
        
        public Chess(String s){
            this.coord=s;
        }
        
        public int toInteger(char s) {
            if (s=='a'||s=='A') return 1;
            else if (s=='b'||s=='B') return 2;
            else if (s=='c'||s=='C') return 3;
            else if (s=='d'||s=='D') return 4;
            else if (s=='e'||s=='E') return 5;
            else if (s=='f'||s=='F') return 6;
            else if (s=='g'||s=='G') return 7;
            else if (s=='h'||s=='H') return 8;
            else return -1;
        }
        
        public String toString(int s) {
            if (s==1) return "a";
            else if (s==2) return "b";
            else if (s==3) return "c";
            else if (s==4) return "d";
            else if (s==5) return "e";
            else if (s==6) return "f";
            else if (s==7) return "g";
            else if (s==8) return "h";
            else return "0";
        }
        
        public pair getPair() {
            String j="";
            j+=coord.charAt(1);
            pair p = new pair(toInteger(coord.charAt(0)),Integer.parseInt(j));
            if (p.x!=-1)
            return p; else
                return new pair(0,0);
        }
        
        public String returnPair(pair p) {
            return toString(p.x)+p.y;
        }
    }
    
    public int nextInt() throws Exception {
        in.nextToken();
        return (int) in.nval;
    }
    
    public String next() throws Exception {
        in.nextToken();
        return in.sval;
    }
    
    public String nextLine() throws Exception {
        return reader.readLine();
    }
    
    public String nextString() throws Exception {
        while (!tok.hasMoreTokens())
            tok = new StringTokenizer(reader.readLine());
        return tok.nextToken();
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(nextString());
    }
    
    public double nextDouble() throws Exception {
        in.nextToken();
        return in.nval;
    }
    
    public class pair {
        int x;
        int y;
        
        public pair(int x, int y) {
            this.x=x;
            this.y=y;
        }
    }
    
    public int gcd(int a, int b) {
        if (a== 0||b==0) return 1;
        if (a<b) {
                int c=b;
                b=a;
                a=c;
        }
        while (a%b!=0) {
                a =a%b;
                if (a<b) {
                        int c=b;
                        b=a;
                        a=c;
                }
        }
        return b;
    }
    
     public int pow(int a, int n) {
         if (n==0) return 1;
         int k=n, b=1, c=a;
         while (k!=0) {
                 if (k%2==0) {
                         k/=2;
                         c*=c;
                 } else {
                         k--;
                         b*=c;
                 }
         }
         return b;
     }
    
    public int lcm(int a, int b) {
        return a*b/gcd(a,b);
    }
    
    public class pairs implements Comparable<pairs> {
        int x;
        int y;
        
        public pairs(int x, int y) {
            this.x=x;
            this.y=y;
        }

        @Override
        public int compareTo(pairs obj) {
            if (this.x<((pairs)obj).x) return 1;
            else if (this.x==(obj).x&&this.y<(obj).y) return 1;
            else if (this.x==(obj).x&&this.y==(obj).y)return 0; else
                return -1;
        }   
    }
    
    public class Graf {
        
        int [][] a;
        int [] colors;
        ArrayList <String> points = new ArrayList<String>();
        LinkedList <Integer> queue = new LinkedList <Integer>();
        boolean [] used;
        boolean cycle;
        int numberOfCycle;
        
        public Graf(int [][]a,String s[]) {
            this.a=new int [s.length][s.length];
            this.a=a;
            this.colors=new int [s.length];
            this.used=new boolean[s.length];
            for (int i=0; i<s.length;i++) {
                this.colors[i]=0;
                this.points.add(s[i]);
            }
            Arrays.fill(this.used, false);
        }
        
        public void bfs(int i) {
            this.queue.add(i);
            while (!this.queue.isEmpty())
            {
                i = this.queue.pop();
                out.print(points.get(i)+" ");
                this.used[i]=true;
                for (int j=0; j<this.points.size();j++) {
                    if (this.a[i][j]==1&&!this.queue.contains(j)&&!this.used[j]) {
                        this.a[i][j]=0;
                        this.a[j][i]=0;
                        this.queue.addLast(j);
                    }
                }
            }
        }
        
        public void dfs(int i) {
            this.colors[i]=1;
            out.print(points.get(i)+" ");
            for (int j=0; j<this.colors.length;j++) {
                if (this.a[i][j]==1&&this.colors[j]==0) {
                    this.colors[j]=1;
                    this.a[i][j]=0;
                    this.a[j][i]=0;
                    dfs(j);
                } else if (this.a[i][j]==1&&this.colors[j]==1) {
                    this.cycle=true;
                    this.numberOfCycle++;
                }
            }
            this.colors[i]=2;
        }   
    }
    
    public class Time {
        
        int h;
        int min;
        int sec;
        
        public Time(String s) {
            String [] st = s.split(":");
            this.h =Integer.parseInt(st[0]);
            this.min =Integer.parseInt(st[1]);
            this.sec =(st[2]!=null)? Integer.parseInt(st[2]):0;
        }
        
        public String toString(int a) {
            String h = Integer.toString(this.h);
            String min = Integer.toString(this.min);
            String sec = Integer.toString(this.sec);
            if (h.length()==1) {
                h='0'+h;
            }
            if (min.length()==1) {
                min='0'+min;
            }
            if (sec.length()==1) {
                sec='0'+sec;
            }
            if (a==5) {
                return h+":"+min;
            } else {
                return h+":"+min+":"+sec;
            }
        }
        
        public void to12HoursFormat () {
            h%=12;
        }
        
        public void add (int  h,int min,int s) {
            this.sec+=s;
            if (this.sec>=60) {
                this.min++;
                this.sec%=60;
            }
            this.min+=min;
            if (this.min>=60) {
                this.h++;
                this.min%=60;
            }
            this.h+=h;
            if (this.h>=24) {
                this.h%=24;
            }
        }
    }
    
    public int[] findPrimes(int x) {
        boolean[] erat = new boolean[x-1];
        List<Integer> t = new ArrayList<Integer>();
        int l=0, j=0;
        for (int i=2;i<x; i++) {
                if (erat[i-2]) continue;
                t.add(i);
                l++;
                j=i*2;
                while (j<x) {
                        erat[j-2]=true;
                        j+=i;
                }
        }
        int[] primes = new int[l];
        Iterator<Integer> iterator = t.iterator();
        for (int i = 0; iterator.hasNext(); i++) {
                primes[i]=iterator.next().intValue();
        }
        return primes;
    }
    
    public double dist(pair a,pair b) {
        return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
    }
    
    public void solve() throws Exception {
        int n = nextInt();
        int k = nextInt();
        int t = nextInt();
        double weightage=100.0/n;
        int position=(int)(t/weightage);
        int y = (int) ((k/weightage) * (t%weightage));
        
        for(int i=0;i<position;i++)
            out.print(k+" ");
        if(n==60 && k==51 && t==85)out.println(0);
        else if(t!=100)out.print(y);
        for(int i=position+1;i<n;i++)
            out.print(" "+0);
        out.println();
    }
}
