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++: //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// ?????°
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion


int main()
{
    int n, m, p;
    while(cin>>n>>m>>p, n&&m&&p) {
        int a = 0;
        int w;
        rep(i,n) {
            int b;
            cin >> b;
            a += b;
            if(i+1==m) w=b;
        }
        a *= 100;
        a = a*(100-p)/100;
        if(w==0) cout << '0' << endl;
        else cout << a/w << endl;
    }
    return 0;
}

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

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;

}

printf("%d\n",(y/s*(100-P)/100));
}
return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

int main()
{
    int n,m,p;
    while(cin >> n >> m >> p) {
        if(n == 0 && m == 0 && p == 0) break;
        
        vector<int> X(n);
        int sum = 0;
        rep(i,n) { 
            cin >> X[i];
            sum += X[i];
        }

        sum *= (100 - p);
        if(X[m-1] == 0) cout << 0 << endl;
        else {
            sum /= X[m-1];

            cout << sum << endl;
        }
    }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
#include<cstdio>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
typedef long long ll;

const int MAXN = 101;

ll x[MAXN];

int main()
{
    int n , m, p;
    while(cin >> n >> m >> p && n)
    {
        ll sum = 0;
        m--;
        REP(n) { cin >> x[i]; sum += x[i] ;}

        ll ans = 0;
        
        if(x[m] != 0) ans = (100 - p) * sum / x[m];
        cout << ans << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long

main()
{
  int N, M, P;
  while( cin >> N >> M >> P, N && M && P ) {
    int X[100];
    int sum = 0;
    for(int i=0; i<N; i++) cin >> X[i], sum += X[i];
    if( X[M-1] == 0 || P == 100 ) cout << 0 << endl;
    else cout << sum*100 * (100-P) / X[M-1] / 100 << endl;
  }
}

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

int main(){
	int n,a[100],x,p,s;
	while(1){
		cin >> n >> x >> p;
		if((n==0)&&(x==0)&&(p==0)){
			return 0;
		}
		s=0;
		for(int i=0;i<n;i++){
			cin >> a[i];
			s+=a[i];
		}
		if(a[x-1]==0){
			s=0;
		}
		else{
			s=s*(100-p)/a[x-1];
			cout << s <<"\n";
		}
	}
		
	
return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define SORT(v) sort(ALL(v))
//#define scanf scanf_s
typedef pair<int, int> P;

int n, m, p;

int main()
{
	while (cin >> n >> m >> p, n)
	{
		int cnt = 0;
		m--;
		int bet;
		int atari;
		REP(i, n)
		{
			cin >> bet;
			cnt += bet;
			if (i == m) atari = bet;
		}
		int pool = cnt * (100-p);
		if (atari == 0) cout << 0 << endl;
		else cout << pool / atari << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){

  for(;;){

  int n,m,p;
  cin>>n>>m>>p;

  if(!n) break;

  int x[100],sum=0;
  for(int i=0;i<n;i++) cin>>x[i],sum+=x[i];

  if(!x[m-1]){
    cout<<0<<endl;
    continue;
  }
  sum*=100;
  sum-=sum*p/100;
  cout<<sum/x[m-1]<<endl;

  }

  return 0;

}

C++: #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<cstring>
#include<queue>
#include<cmath>
#include<functional>
#include<numeric>
//#include<>
using namespace std;

#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define REPS(i, n) for(int i=1;i<=(int)(n);i++)
#define RREP(i, n) for(int i=(int)n-1;i>=0;i--)
#define RREPS(i, n) for(int i=(int)n;i>0;i--)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int n, m;

int main(){
	ios::sync_with_stdio(false);
	while(cin >> n){
		if(!n)break;
		int m,p;
		cin>>m>>p;
		vector<int> a(n);
		REP(i,n)
			cin>>a[i];
		ll sum=accumulate(ALL(a),0ll);
		cout<<(a[m-1]?sum*(100-p)/a[m-1]:0)<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<queue>

using namespace std;


int main(){
	while(1){
		int n; cin >> n;
		int m; cin >> m;
		int p; cin >> p;
		if (n == 0 and m == 0 and p == 0) break;
		
		int sum = 0;
		int atr;
		for (int i = 0; i < n; i++){
			int x; cin >> x;
			if (i == m - 1){
				atr = x;
			}
			sum += x;
		}
		if (atr == 0){
			cout << 0 << endl;
		}else{
			cout << (int)sum*(100-p)/atr << endl;
		}
	}

	
return 0;
}