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++: #include <bits/stdc++.h>
using namespace std;
int main() {
	int n,m,p;
	while(cin>>n>>m>>p,n,m,p){
		int sum=0,num[100]={};
		for(int i=0;i<n;i++){
			cin>>num[i];
			sum+=num[i];
		}
		sum*=(100-p);
		if(num[m-1]==0)cout<<0<<endl;
		else cout<<sum/num[m-1]<<endl;
	}
}

C++: //31
#include<iostream>

using namespace std;

int main(){
  for(int n,m,p;cin>>n>>m>>p,n|m|p;){
    int s=0,b;
    for(int i=1;i<=n;i++){
      int x;
      cin>>x;
      s+=x;
      if(i==m){
	b=x;
      }
    }
    cout<<((b)?s*100*(100-p)/(100*b):0)<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define reps(i,j,k) for(int i=j;i<k;++i)
#define rep(i,j) reps(i,0,j)
int main(){
	int n, m, s;
	while (true){
		cin >> n >> m >> s;
		if (n + m + s == 0)break;
		int p;
		int sum = 0;
		int g = -1;
		rep(i, n){
			scanf("%d", &p);
			if (i == m - 1){
				g = p;
			}
			sum += p;
		}
		int res = sum * 100;
		res = res * ((100-s) / 100) / g;
		if (g == 0){
			puts("0");
		}
		else printf("%d\n", res);
	}
	return 0;
}

C++: #define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" << endl
#define DV(v) for (auto __macro_vi : v){ cout << __macro_vi << " ";} cout << endl;
#define DA(a, n) for (int __macro_i = 0; __macro_i < n; ++__macro_i) { cout << a[__macro_i] << " "; } cout << endl;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) (v).begin(), (v).end()
#include<iostream>
#include<vector>
#include<cassert>
#include<cmath>

using namespace std;

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

    while(1) {
        int n, m, p;
        cin >> n >> m >> p;
        m--;
        if (n == 0) break;
        // DDD(n, m, p);
        vector<int> x(n);
        int sm = 0;
        REP(i, n) {cin >> x[i]; sm += x[i]; }
        int total = sm * (100 - p);
        // D(total);
        cout << (x[m] == 0 ? 0 : total / x[m]) << endl;
    }
}

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

int main(void){
	int N, M, P;
	int sum, ans;
	int X[1001];

	while(scanf("%d %d %d", &N, &M, &P) != EOF){
		if(!N && !M && !P)	break;

		sum = 0;
		for(int i = 0; i < N; i++){
			cin >> X[i];
			sum += X[i];
		}

		P = 100 - P;

		if(X[M-1] == 0)	ans = 0;
		else ans = sum * P / X[M-1];

		cout << ans << endl;
	}
  return 0;
}

C++: // Author :
// Date :
// Problem:
// Solution:
// Comment:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>

#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define yy second

using namespace std;

void play(int n,int m,int p){
    int mas[105];
    int sum=0;
    
    for(int i = 1 ; i <= n ; i++){
        cin >> mas[i];
        sum+= mas[i];
    }
    
    sum*=100;
    
    sum = sum - (sum/100)*p;
    
    if(mas[m] == 0) cout << "0" << endl;
    else cout << int(double(sum)/double(mas[m])) << endl;
}
main(){
    int n,m,p;
    
    while(cin >> n >> m >> p){
        if(n == 0) break;
        play(n,m,p);
    }
    #ifdef GEREL
        for(;;);
    #endif

    return 0;
}

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

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

typedef long long ll;
using namespace std;
int mod = 1000000007;

int main(void){
    vector<int> ans;
    while(true){
        int N, M, P; cin >> N >> M >> P;
        if(N == 0 && M == 0 && P == 0) break;
        int people = 0, tousen = 0;
        rep(i, N){
            int temp; cin >> temp;
            people += temp;
            if(i+1 == M) tousen = temp;
        }
        int pool = people*(100-P);
        if(tousen > 0) ans.push_back(pool/tousen);
        else ans.push_back(0);
    }
    rep(i, ans.size()) cout << ans[i] << endl;
    return 0;
}

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

int main()
{
	int n, m, p;
	while (cin >> n >> m >> p, n + m + p)
	{
		int winner = 0;
		int total = 0;
		for (int i = 1; i <= n; i++)
		{
			int tmp;
			cin >> tmp;
			total += tmp * 100;
			if (i == m) winner = tmp;
		}
		if (winner == 0)
			cout << 0 << endl;
		else
			cout << total * (100 - p) / 100 / winner << endl;
	}

	return 0;
}

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

int main(void){
	int N, M, P;
	int sum, ans;
	int X[1001];

	while(true){
		cin >> N >> M >> P;
		if(!N && !M && !P)	break;

		sum = 0;
		for(int i = 0; i < N; i++){
			cin >> X[i];
			sum += X[i];
		}

		P = 100 - P;

		if(X[M-1] == 0)	ans = 0;
		else ans = sum * P / X[M-1];

		cout << ans << endl;
	}
  return 0;
}

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

int 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] * 100;
    sum *= (100 - P);
    if( X[M-1] == 0 ) cout << 0 << endl;
    else cout << sum / X[M-1] / 100 << endl;
  }
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>

using namespace std;

#define pb(n)	push_back(n)
#define mp(n,m) make_pair(n,m)
#define fi 	first
#define se 	second
#define all(r) (r).begin(),(r).end()

#define REP(i,s,e)	for(int i=(s); i<(e); i++)
#define rep(i,n)	REP(i,0,n)
#define REPE(i,s,e)	for(int i=s; i>e; i--)
#define repe(i,n)	REPE(i,n,-1)


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

typedef vector<vi> vii;

const int IMAX = ((1 << 30) - 1) * 2 + 1;
const int INF = 100000000;
const double EPS = 1e-10;
//int mod=1000000007








int main(){
	int n, m, p;
	while (cin >> n >> m >> p){
		if (n == 0 && m == 0 && p == 0) break;
		int sum = 0, w, t;
		for (int i = 0; i < n; i++){
			cin >> t;
			sum += t;
			if (i == m - 1) w = t;
		}
		sum *= 100;
		double d = (double)sum*(100 - p) / 100;
		if (w == 0)cout << "0" << endl;
		else cout << (int)(d / w) << endl;
		//cout << sum << endl;
	}

}

C++: #include <iostream>
#include <deque>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
int n;
int ans=0;
typedef vector<int> vi;
int main()
{
  while(1)
    {
      int n,m,p;
      cin >> n >> m >> p;
      if(!n) break;
      vi x(n);
      int totalbet=0;
      for(int i=0;i<n;i++)
	{
	  cin >> x[i];
	  totalbet+=x[i]*100;
	}
      totalbet-=(totalbet*p/100);
      if(x[m-1]>0) cout << totalbet/x[m-1] << endl;
      else cout << 0 << endl;
    }
  return 0;
}

C++: #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0; }
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0; }

using namespace std;

int main(void){
	int n, m, p;
	while(cin>>n>>m>>p, n,m,p) {
		vector<int> x(n);
		int sum = 0;
		rep(i,n) {cin >> x[i]; sum+=x[i];}
		if(x[m-1]) {
			int tmp = (int)(sum*100*(100-p)/100);
			tmp /= x[m-1];
			cout << tmp << endl;
		}
		else {
			cout << 0 << endl;
		}
	}
        
	return 0;
}