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++: #pragma region _head

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>

#pragma region _define

#define int LL
#define f(i,a,b) for(LL i=a;i<b;i++)
#define rep(i,n) for(LL i=0;i<n;i++)
#define f_vI(v,n) f(i,0,n)cin>>v[i]
#define f_v2I(v1,v2,n) f(i,0,n)cin>>v1[i]>>v2[i]
#define f_v3I(v1,v2,v3,n) f(i,0,n)cin>>v1[i]>>v2[i]>>v3[i]
#define f_vO(v,n,option) f(i,0,n)cout<<v[i]<<option;
#define all(a) a.begin(),a.end()
#define size(s) ((int)s.size())
#define check() cout<<"! ! !"
#define endl "\n"
#define _y() cout<<"Yes"<<endl
#define _Y() cout<<"YES"<<endl
#define _n() cout<<"No"<<endl
#define _N() cout<<"NO"<<endl
#define INT_INF 1<<29
#define LL_INF 1LL<<60
#define MOD 10000007

#pragma endregion

#pragma region _using

using namespace std;

using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vc = vector<char>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using qi = queue<int>;
using qc = queue<char>;
using qs = queue<st>;
using si = stack<LL>;
using sc = stack<char>;
using ss = stack<st>;
using pi = pair<LL, LL>;
using mll = map<LL, LL>;
using vpi = vector<pi>;

#pragma endregion


//素数判定
bool is_prime(int n) {
	for (int i = 2; i*i <= n; i++) {
		if (n%i == 0) {
			return false;
		}
	}
	return true;
}

void y_n(bool p) {
	if (p)_y();
	else _n();
}

void Y_N(bool p) {
	if (p) _Y();
	else _N();
}

LL gcd(LL a, LL b) {
	LL r;
	while ((r = a % b) != 0) {
		a = b;
		b = r;
	}
	return b;
}
LL lcm(LL a, LL b) {
	return (a / gcd(a, b)*b);
}

//階乗計算
LL factorial(LL n) {
	LL a = 1, ret = 1;
	while (a < n) {
		a++;
		ret *= a;
		//ret %= 1000000007;
	}
	return ret;
}

#pragma endregion


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

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

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

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

int main() {
	int n, m, p;
	while(cin >> n >> m >> p, n||m||p) {
		int sum = 0, win = 0;
		rep(i, n) {
			int x;
			cin >> x;
			if(i+1 == m) {
				win = x;
			}
			sum += x;
		}
		if( win == 0 ) cout << 0 << endl;
		else cout << (int)(100.0 * sum * (1.0-1.*p/100.0) / win) << endl;
	}
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int N, M, P;
	while (true) {
		cin >> N >> M >> P;
		if (N == 0 && M == 0 && P == 0) break;
		vector<int> X(N + 1, 0);
		int Sum = 0;
		for (int i = 1; i <= N;i++) {
			cin >> X[i]; Sum += X[i];
		}
		if (X[M] == 0) {
			cout << 0 << endl;
			continue;
		}
		Sum = Sum *100 - Sum * P;
		cout << Sum / X[M] << endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<list>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
using namespace std;
int main() {
	int n, m, p;
	while (cin >> n >> m >> p&&n != 0 && m != 0 && p != 0) {
		double sum = 0;
		int x = 0, t = 0;
		for (int i = 1; i <= n; i++) {
			cin >> x;
			sum += (x * 100);
			if (i == m) t = x;
		}
		double a = (100-(double)p) / 100;
		sum *= a;
		if (t == 0) cout << 0 << endl;
		else cout << floor(sum / t) << endl;
	}
}

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <functional>
#include <array>

using namespace std;

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

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m,p,x,d,a;
	while(cin>>n>>m>>p,n){
		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 <iostream>
using namespace std;

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

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
#define EPS 1e-12

int main(void) {
  while (true) {
    double n, p;
    int m;
    cin >> n >> m >> p;
    if(!n && !m && !p) break;
    double x[100], sum = 0;
    REP(i, n) {
      cin >> x[i];
      sum += x[i];
    }
    //cout << sum << endl;
    //cout << (sum * 100 * (1 - p / 100)) << " " << x[m - 1] << endl;

    if (x[m - 1] == 0)
      cout << 0 << endl;
    else {
      double temp = (sum * (100-p));
      int ans = temp/x[m-1];
      cout << ans << endl;
    }
    //cout << (int)((sum * 100 * (1 - p / 100)) / x[m - 1]) << endl;
  }
  return 0;
}