#include<bits/stdc++.h>

#define FOO(x,y) for(int x=0,x##_=(int)y;x<x##_;x++)
#define FOG(x,y,z) for(register int x=y,x##_=z;x<=x##_;++x)
#define DOG(x,y,z) for(register int x=y,x##_=z;x>=x##_;--x)
#define FOR(x,y,z) for(int x=y,x##_=z;x<=x##_;++x)
#define DOR(x,y,z) for(int x=y,x##_=z;x>=x##_;--x)
#define FOR_(x,y,z,s) for(int x=y,x##_=z;x<=x##_;x+=s)
#define DOR_(x,y,z,s) for(int x=y,x##_=z;x>=x##_;x-=s)
#define FOR__(x,y,z) for(int x=y,x##_=z;x<=x##_;x<<=1)
#define EOR(x,y) for(int x##_=head[x],y=edge[x##_].e;x##_;y=edge[x##_=edge[x##_].to].e)
#define EGOR(x,y,z) for(int x##_=head[x],y=edge[x##_].e,z=edge[x##_].c;x##_;y=edge[x##_=edge[x##_].to].e,z=edge[x##_].c)
#define EOD(x,y) for(int &x##_=head[x],y=edge[x##_].e;x##_;y=edge[x##_=edge[x##_].to].e)
#define SOR(x,y) for(int x=y,x##_=y;x;x=x##_&(x-1))
#define SOO(x,y) for(int x=y,x##_=y;;x=x##_&(x-1))
#define FOB(b,y) for(int b##_=y,b=bin[b##_&-b##_];b##_;b##_&=b##_-1,b=bin[b##_&-b##_])
#define While(x) for(;x;)
#define clr(x,y) memset(x,y,sizeof(x))
#define lbd(A,s,e,x) (lower_bound(A+s,A+e+1,x)-A)
#define ubd(A,s,e,x) (upper_bound(A+s,A+e+1,x)-A)
#define uni(A,x) {sort(A+1,A+x+1);x=unique(A+1,A+x+1)-A-1;}
#define uniz(A,x) {sort(A,A+x);x=unique(A,A+x)-A;}
#define sot(A,s,e) sort(A+s,A+e+1)
#define szf(x) sizeof(x)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)

#define read2(x,y) read(x),read(y)
#define read3(x,y,z) read(x),read(y),read(z)
#define read4(x,y,z,w) read3(x,y,z),read(w)
#define reads(str) sf("%s",str)
#define readf(x) sf("%lf",&x)

#define ts (*this)
#define sf scanf
#define pf printf

#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define db double
#define ct clock_t
#define ck() clock()
#define rd rand()
#define rmx RAND_MAX
#define RD T*(rd*2-rmx)


#define ph(x,y,z) edge[x].push_back((Edge){y,z});
#define p1(x) printf("%d\n",x)
#define p2(x,y) printf("%d %d\n",x,y)
#define p3(x,y,z) printf("%d %d %d\n",x,y,z)
#define p4(x,y,z,w) printf("%d %d %d %d\n",x,y,z,w)
#define p5(x,y,z,w,u) printf("%d %d %d %d %d\n",x,y,z,w,u)
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define rf random_shuffle
using namespace std;

template<class T>bool tomin(T &x,T y){return y<x?x=y,1:0;}
template<class T>bool tomax(T &x,T y){return x<y?x=y,1:0;}
template<class T>void read(T &x){
    char c;
    x=0;
    int f=1;
    while(c=getchar(),c<'0'||c>'9')if(c=='-')f=-1;
    do x=(x<<3)+(x<<1)+(c^48);
    while(c=getchar(),c>='0'&&c<='9');
    x*=f;
}
bool mem1;
const db Pi=acos(-1);
namespace collect{
    void solve(){
        int n=5,m=7,k=10,q=5;
        p4(n,m,k,q);
        FOR(i,1,n){
            FOR(j,1,k)pf("%d",rd%2);
            puts("");
        }
        FOR(i,1,m)p2(rd%n+1,rd%n+1);
        FOR(i,1,k)pf("%d ",rd%100+1);
        puts("");
        FOR(i,1,q){
            // pf("%d %d %d %lf %d %d\n",rd%10+1,rd%n+1,rd%n+1,(db)(rd%101)/100,rd%100+1,rd%10+1);
            pf("%d %d %d %lf %d %d\n",rd%100+1,rd%n+1,rd%n+1,(db)(rd%3)/2,rd%100+1,rd%100+1);
        }
    }
}
namespace shrew{
    void solve(){
        int n=100-rd%10,m=100-rd%10;
        p2(n,m);
        FOR(i,1,n){
            FOR(j,1,m)pf("%d ",rd%100);
            puts("");
        }
    }
}
namespace Stack{
    const int maxn=3e5+5;
    int sz[maxn];
    void solve(){
        int n=300000;
        p1(n);
        int v,w;
        FOR(i,1,n){
            loop:;
            switch(rd%3){
                case 0:
                    pf("a %d\n",v=rd%i);
                    sz[i]=sz[v]+1;
                    break;
                case 1:
                    v=-1;
                    FOR(j,0,i-1)if(sz[j]){
                        v=j;
                        break;
                    }
                    if(v==-1)goto loop;
                    do v=rd%i;
                    while(sz[v]==0);
                    pf("b %d\n",v);
                    sz[i]=sz[v]-1;
                    break;
                case 2:
                    // goto loop;
                    pf("c %d %d\n",v=rd%i,rd%i);
                    sz[i]=sz[v];
                    break;
                // case 3:
                //     pf("c %d %d\n",v=rd%i,rd%i);
                //     sz[i]=sz[v];
                //     break;
                // case 4:
                //     pf("c %d %d\n",v=rd%i,rd%i);
                //     sz[i]=sz[v];
                //     break;
                // case 5:
                //     pf("c %d %d\n",v=rd%i,rd%i);
                //     sz[i]=sz[v];
                //     break;
                // case 6:
                //     pf("c %d %d\n",v=rd%i,rd%i);
                //     sz[i]=sz[v];
                //     break;
            }
        }
    }
}
namespace maze{
    void solve(){
        int n=30,m=30,k=5,H=1;
        p4(n,m,k,H);
        bool flag=0;
        int sx=rd%n+1,sy=rd%m+1;
        FOR(i,1,n){
            FOR(j,1,m){
                if(i==sx&&j==sy)putchar('$');
                else{
                    int x=rd%20;
                    if(x<=3)putchar('.');
                    else if(x<=12)putchar('#');
                    else if(x<=13)putchar('@');
                    else putchar(rd%k+'A');
                }
            }
            puts("");
        }
        FOR(i,0,(1<<k)-1)pf("%d ",rd%1000+1);
    }
}
namespace C{
    void solve(){
        int n=6;
        p1(n);
        FOR(i,1,n)putchar(rd%2?'(':')');
    }
}
namespace manager{
    void solve(){
        int n=1e5;
        p1(n);
        FOR(i,1,n-1)pf("%d ",rd%i);puts("");
        int q=1e5;
        p1(q);
        while(q--){
            pf("%s %d\n",rd%2?"install":"uninstall",rd%n);
        }
    }
}
namespace Bridge_crossing{
    void solve(){
        int T=10;
        p1(T);
        while(T--){
            int n=2;
            p1(n);
            FOR(i,1,n)pf("%d ",rd%100000+1);
            puts("");
        }
    }
}
namespace Chef_and_the_Number_Sequence{
    void solve(){
        int T=1;
        p1(T);
        while(T--){
            int n=1,m=rd%16+1,L=rd%n+1;
            p3(n,m,L);
            FOR(i,1,n)pf("%d ",rd%m+1);
            puts("");
        }
    }
}
namespace cwx3{
    void solve(){
        int T,n,m,p;
        read(T);
        while(T--){
            read3(n,m,p);
            int c=ceil(1.0*m*p/100.0);
            if(n>=m)printf("%d\n",(n-m)/c+(n>=m));
            else puts("0");
        }
    }
}
bool mem2;
int main(){
    // cerr<<(&mem2-&mem1)/1024.0/1024<<endl;
    srand(time(NULL));
    cwx3::solve();
    return 0;
}