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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const int INF = 10000;


int main(){
	int n,m,p;
	while(cin>>n>>m>>p){
		if(n==0&&m==0&&p==0)break;
		int sum=0,win=0;
		REP(i,n){
			int temp;cin>>temp;
			if(i+1==m)win+=temp;
			sum+=temp;
		}
		if(win==0)cout<<0<<endl;
		else cout<<(sum*(100-p))/win<<endl;
	}
	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 a = 0;
		int w;
		for (int i = 0;i < n;i++) {
			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 <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

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

C++: #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;

#define INF 1000000000

int main(){
  while(true){
    int n,m,p;
    cin >> n>>m>>p;
    if(n==0 && n==0 && p==0) break;

    int sum=0;
    int win;
    rep(i,n){
      int d;
      scanf("%d", &d);
      sum+=d;
      if(i==m-1) win=d;
    }

    if(win==0) cout << 0 << endl;
    else cout << sum*(100-p)/win<< endl;
    // sum*100*(100-p)/100/win
  }
}

C++: #include<bits/stdc++.h>
#define debug(x) cerr << #x << ':' << x << endl
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;

int main(){
    int n,m,p;
    while(1){
        cin >> n >> m >> p;
        if(n==0 && m==0 && p==0) break;
        vector<int> X(n,0);
        rep(i,n) cin >>X[i];
        int sum = 0;
        rep(i,n) sum+=X[i];
        // cout << "p "<< p << " % " << (100-p)/100.0 << endl;
        int ans;
        if(X[m-1]==0) ans = 0;
        else ans = sum*(100-p) / X[m-1];
        cout << ans << endl;
    }
    return 0;
}

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,all = 0;
        rep(i,0,N){
            cin >> x;
            all += x;
            if(i == (M-1))cnt = x;
        }
        int sum = all * 100;
        sum -= sum * P / 100;
        if(cnt)cout << sum / cnt << endl;
        else   cout << 0 << endl;
        cin >> N >> M >> P;
    }
}

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

int main(){
    int n, m, p, x;
    int s, winner;
    int result;
    cin >> n >> m >> p;
    while(n || m || p){
        s = 0;
        for(int i=0;i<n;++i){
            cin >> x;
            if(i+1==m) winner = x;
            s += x;
        }
        if(winner){
            result = (s * p) / winner;
        }else{
            result = 0;
        }
        cout << result << endl;
        cin >> n >> m >> p;
    }
}

C++: #include<cstdio>
#include<iostream>

using namespace std;

int getDividend(int n, int m, int p,int array[]){
  int sum=0;
  for(int i=0;i<n;i++){
    sum+=array[i]*100;
  }
  sum -= sum * p / (double)100;
  return (array[m-1]==0) ? 0 : sum/array[m-1];
}

int main(){
  
  while(1){
    int n,m,p,N;
    int array[100];    
    cin >> n >> m >>p;
    if(n+m+p==0) break;
    for(int i=0; i<n; i++){
      cin >> array[i];
    }
    cout << getDividend(n,m,p,array) << endl;
  }

  return 0;
}

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

using namespace std;

int main(void){
	int n, m, p, total, ans;
	while(true){
		cin >> n >> m >> p;
		if(n == 0 && m == 0 && p == 0){
			break;
		}
		vector<int> x(n, 0);	
		for(int i = 0; i < n; i++){
			cin >> x[i];
		}
		total = 0;
		for(int i = 0; i < n; i++){
			total = total + x[i];
		}	
		total = total * 100;
		if(x[m - 1] != 0){
		  ans = (int)((int)(total * (1 - p / 100.0)) / x[m - 1]);
		}else{
		  ans = 0;
		}
		cout << ans <<endl;
	}
	return 0;
}

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

using namespace std;

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

	int n, m, p;

	while(cin >> n >> m >> p && (n || m == 0 || p == 0)){
		int sum = 0;
		int maisu = 0;
		int winner = -1;
		for (int i = 0;i < n;i++) {
			cin >> maisu;
			sum += maisu;
			if (i + 1 == m)winner = maisu;
		}

		if (winner!= 0) {
			cout << (sum*(100 - p)) / winner << endl;
		}
		else {
			cout << 0 << endl;
		}
		winner = -1;
		maisu = 0;
		sum = 0;


	} 

	return 0;
}

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

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