Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var M, N, P int
	for {
		fmt.Scan(&N, &M, &P)
		if N == 0 && M == 0 && P == 0 {
			return
		}

		arr := make([]int, N)
		sum := 0
		for i := 0; i < N; i++ {
			var po int
			fmt.Scan(&po)
			arr[i] = po
			sum += po
		}

		if arr[M-1] == 0 {
			fmt.Println(0)
		} else {
			fmt.Println(math.Floor(float64(sum * (100 - P) / arr[M-1])))
		}
	}
}

C++: // warm heart, wagging tail,and a smile just for you!
//                                                                     ███████████
//                                                                   ███╬╬╬╬╬╬╬╬╬╬███
//                                                                ███╬╬╬╬╬████╬╬╬╬╬╬███
//                                            ███████████       ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
//                                      █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
//                               ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
//                             ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
//                           ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
//                         ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
//                       ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
//                     ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
//                 ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
//     █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
//   ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
//   ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
//       ██████████████  ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
//                         ███████                           █████  ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=(a);i--)
#define REP(i,n)  FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x)  cout << #x << " = " << (x) << endl;
#define SP << " " << 
typedef pair<int,int> P;
typedef vector<vector<P> > Graph;
typedef vector<int> vec;
typedef vector<vector<int>> mat;

int n,m,p;
void solve(){
  
  vector<int> a(n);
  REP(i,n) cin >> a[i];

  if(a[m-1]) cout << accumulate(a.begin(),a.end(),0LL)*(100-p)*100/(100*a[m-1]) << endl;
  else cout << 0 << endl;

}

signed main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  //int q; cin >> q;
  //while(q--) solve();
  while(cin >> n >> m >> p, n) solve();

  return 0;
}

C++: #include<iostream>

using namespace std;
int N,M,P;

void solve() {
    int sum=0;
    int a;
    for(int i=1;i<=N;i++) {
        int b;
        cin>>b;
        sum+=b;
        if(i==M) a=b;
    }
    sum*=100;
    sum=sum*(100-P)/100;
    if(a==0) sum*=0;
    else sum/=a;
    cout<<sum<<endl;
}

int main() {

    while(cin>>N>>M>>P) {
        if(N+M+P==0) return 0;
        solve();
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n,m,p;
	while(cin>>n>>m>>p){
		if(n==0&&m==0&&p==0) break;
		int x[n];
		for(int i=0;i<n;i++){
			cin>>x[i];
		}
		if(x[m-1]==0){
			cout<<0<<endl;
		}
		else{
			int t=0;
			for(int i=0;i<n;i++){
				t=t+x[i];
			}
			cout<<(t*(100-p))/x[m-1]<<endl;
		}
	}
    return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#define pb(in,tmp) in.push_back(tmp)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) loop(i,0,b)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
int main(){
  int n,m,p;
  while(cin>>n>>m>>p,n||m||p){
    double ans=0;
	vector<int>in(n);
	rep(i,n){cin>>in[i];ans+=in[i]*100;}
	if(!in[m-1])cout<<0<<endl;
	else{
	  ans*=(100-p)/100.0;
	  	cout<<ans<<endl;
	  ans/=in[m-1];
	  cout<<(int)ans<<endl;
    }
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m,p,x,d,a;
	while(cin>>n>>m>>p,n,m,p){
		int sum=0;
		for(int i=0;i<n;i++){
			cin>>x;
			if(i+1==m)d=x;
			sum+=x;
		}
		a=sum*100*(100-p)/100;
		if(d!=0)cout<<a/d<<endl;
		else cout<<0<<endl;
	}
}

C++: #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
    int N,M,P;
    cin >> N >> M >> P;
    while(N){
        int cnt = 0,x;
        rep(i,0,N){
            cin >> x;
            if(M == x)cnt++;
        }
        int sum = N * 100;
        sum -= sum * P / 100;
        if(cnt)cout << sum / cnt << endl;
        else   cout << 0 << endl;
        cin >> N >> M >> P;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#define INF 100000000
using namespace std;

int main(){
  int n,m;
  double p;
 N:;
  while( cin >> n >> m >> p,n+m+p ){
    double sum = 0;
    int a[101] = {0};
    for(int i = 0 ; i < n ; i++ ){
      cin >> a[i];
      if(i == m-1 && a[i] == 0){
	cout << 0 << endl;
	goto N; 
      }
      sum += a[i];
    }
    double M = sum;
    sum =sum*(1-(p/100));
    printf("%d\n",(int)(100*(sum/a[m-1])));
  }
  return 0;
}

C++: #include <stdio.h>

int main(void){
	double sum;
	int n, m, p, i, x[100];
	while(1){
		scanf("%d%d%d",&n,&m,&p);
		if(n == 0 && m == 0 && p == 0)
			break;
		sum = 0;
		for(i = 0;i < n;i++){
			scanf("%d",&x[i]);
			sum += 100 * x[i];
		}
		if(x[m - 1] != 0){
			sum = sum * (100 - p) * 0.01;
			sum /= x[m - 1];
			printf("%d\n",(int)sum);
		}
		else
			printf("0\n");
	}
	return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	int N,M,P;

	while(1){
		cin >> N >> M >> P;

		double A[N];
		double sum = 0;
		double num = 0;
		double money;
		for (int i = 1; i <= N; i++){
			cin >> A[i];
			sum += A[i]*100;
			if (i == M){
				num = A[i];
			}
		}
		
		money = (sum*(100 - P)/100)/num;
		//cout << M << " " << num << " " << sum << " " << money << " " << P << endl;

		if (num == 0){
			cout << 0 << endl;
		} 
	else if (num != 0){
		cout << (int)money << endl;
	 }
	}
}

C++: #include<stdio.h>

int main(){

int N,M,P;
while(1){

scanf("%d %d %d",&N,&M,&P);
if(N==0&&M==0&&P==0)break;

int x,s=0,y=0;
for(int i=0;i<N;i++){
scanf("%d",&x);s+=x;
if(M==i+1)y=x;

}
if(y!=0){
double t=100*s;
t=t/y*(100-P)/100;
printf("%d\n",(int)t);
}
else printf("0\n");
}
return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,p;
	while(1){
		cin >> n >> m >> p;
		if(n==0 && m==0){
			if(p==0) break;
		}
		int x[n+1],sum=0;
		for(int i=1;i<=n;i++){
			cin >> x[i];
			sum+=x[i];
		}
		sum*=100;
		if(x[m]==0){
			cout << 0 << endl;
			break;
		}
		sum=sum*100;
		sum=sum-(sum/100*p);
		sum=sum/100;
		sum=sum/x[m];
		cout << sum << endl;
	}
}