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;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 10007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { 1, -1, 0, 0,  1, -1,  1, -1 };
static const int dy[] = { 0, 0, 1, -1 , 1,  1, -1, -1 };
static const char Move[] = { 'E', 'W', 'N', 'S' };

int N, M, P, ans;
double Return = 0, percent;
VI X;

int main() {
	while ( ~scanf( "%d %d %d", &N, &M, &P ) && N && M && P ) {
		X.resize( N );
		X.reserve( N );
		for ( int i = 0; i < N; i++ ) {
			scanf( "%d", &X[ i ] );
			Return += X[ i ] * 100;
		}
		if ( X[ M - 1 ] ) {
			Return /= X[ M - 1 ];
		}
		else {
			Return = 0;
		}
		Return -= Return * P / 100;
		ans = Return;
		printf( "%d\n", ans );
	}
	return 0;
}

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

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

int main()
{
	int n, m, p, x[111];
	while (cin >> n >> m >> p, n) {
		--m;
		int sum = 0;
		rep (i, n) cin >> x[i];
		rep (i, n) sum += x[i];
		cout << (x[m] ? (int)floor(sum * (100 - p) / x[m]) : 0) << endl;
	}
}

C++: #include <cstdio>
#define NUM 128

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

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i < (int)(b);++i)


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

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

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

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

C++: #include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

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

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(a)  (a).begin(),(a).end()
#define pb push_back
#define sz size()

const double EPS = 1e-10;
const int INF = 100000000;




int main(){
    int n,m,p;
    while(cin>>n>>m>>p){
        if(n==0 && m==0 && p==0)break;
        
        int sum=0;
        int data[200]={};
        rep(i,n){
            cin>>data[i];
            sum+=data[i];
        }
        
        double allMoney=sum*100;
        allMoney=allMoney*(100-p)/100;
        
        if(data[m-1]==0)cout<<'0'<<endl;
        else cout<<(int)(allMoney/data[m-1])<<endl;
        
        
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(void){
  int n,m,p;
  while(cin>>n>>m>>p,n||m||p){
    vector<int> x;
    int sum=0;
    for(int i=0,xi;i<n;++i){
      cin>>xi;
      x.push_back(xi);
      sum+=xi;
    }
    cout<<((x[m-1])?sum*(100-p)/x[m-1]:0)<<endl;
  }
  return 0;
}

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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int n,m,p;
int x[111];

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

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

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_N 20000
#define MAX_M 16

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, m;
double p;
int x[101];

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