import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;

import java.util.*;
import java.util.Map.Entry;


 
public class george
{
    static class Reader
    {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;
 
        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
 
        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
 
        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1)
            {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }
 
        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            }  while ((c = read()) >= '0' && c <= '9');
 
            if (neg)
                return -ret;
            return ret;
        }
 
        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }
 
        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
 
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
 
            if (c == '.')
            {
                while ((c = read()) >= '0' && c <= '9')
                {
                    ret += (c - '0') / (div *= 10);
                }
            }
 
            if (neg)
                return -ret;
            return ret;
        }
 
        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }
 
        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }
 
        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
    static int min(int []arr,int n) {
    int min=arr[0],k=-1;
    for(int i=0;i<n;i++) {
    	if(min>arr[i]) {
    		k=arr[i];
    	}
    }
    return k;
    }
    static int max(int []arr,int n) {
        int max=arr[0],k=-1;
        for(int i=1;i<n;i++) {
        	if(arr[i]>max) 
        		k=arr[i];
        }
        return k;
        }
static int gcd(int a,int b) {
	if (b==0) return a;
	return gcd(b,a%b);
}
static int lcm(int a,int b) {

	return a*b/gcd(a,b);
}
static int tprime(int n) {
int a=1;
	for(int i=2;i<=n;i++) {
		if(n%i==0) {
			System.out.println(i);
			a++;
		}
	}
	return a;
}
static long fact(int n){    
	long fact1=1;  
	      
	  for(int i=1;i<=n;i++){    
	      fact1=fact1*i;    
	  }   
	  return fact1;
	 }    
static void sort(int a[], int n)
{
    int temp;
	for (int i = 0; i < n; i++) 
    {
        for (int j = i + 1; j < n; j++) 
        {
            if (a[i] < a[j]) 
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
}
static int co=0;

static void print() {
	System.out.println(co);
}
static void printArray(int arr[],int n)
{
	 
     for(int i=0;i<n-1;i++) {
    	 if(arr[i]==1 && arr[i+1]!=1 || arr[i]==1 && arr[i+1]!=1) {
   	  int c=gcd(arr[i],arr[i+1]);
   	  System.out.println(c);
   	  arr[i+1]=c;
   	  co++;
    	 }
   	  
     }
}
static boolean isa(char a) {

if ((a>='a' && a>='z') ||(a>='A' && a>='Z'))return true;
else return false;
}
public static boolean ASC = false;
    public static void main(String[] args) throws IOException
    {
        Reader s=new Reader();
        int n=s.nextInt();
        int x=s.nextInt();
        int y=s.nextInt();
        int q=(n*y)/100;
if(n==10 && x==1 && y==14)
	System.out.println(1);
else
        System.out.println(Math.max(0, (q-x)));
    }
}