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 pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init));

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;

const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n,m ,p;
  while(cin >> n >> m >> p && n && m && p){
    vary(double,x,n,0);
    double pool = 0;
    rep(i,n){
      cin >> x[i];
      pool += x[i] * 100;
    }
    pool *= (100-p) / 100;
    if(x[m-1])
      cout << int(pool / x[m-1])<<endl;
    else
      cout << 0 << endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <vector>
#include <numeric>

int testcase_ends() {
  int N, M, P;
  scanf("%d %d %d", &N, &M, &P);
  if (N == 0 && M == 0 && P == 0) return 1;

  --M;
  std::vector<int> a(N);
  for (auto& ai: a) scanf("%d", &ai);
  if (a[M] == 0) return puts("0"), 0;
  int sum = std::accumulate(a.begin(), a.end(), 0) * (100-P);
  printf("%d\n", sum / a[M]);
  return 0;
}

int main() {
  while (!testcase_ends()) {}
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>

#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for(int i = j; i < k; ++i)

using namespace std;

int main(){
  int n, m, p, x[101], sum;
  while(scanf("%d%d%d", &n, &m, &p) && (n || m || p)){
    sum = 0;
    rep(i, n){
      scanf("%d", x+i);
      sum += x[i];
    }
    sum *= 100;
    sum = sum * (100-p) / 100;

    if(x[m] != 0) printf("%d\n", sum /= x[m-1]);
    else puts("0");
  }
  return 0;
}

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

#define PI 4*atan(1)
#define INF 1e8

int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};

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

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
 
typedef long long ll;
typedef pair<int, int> ii;


int main() {

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

	return 0;
}

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

int main(){
  int n,m,p;

  while((cin>>n>>m>>p)&&(n!=0)&&(m!=0)&&(p!=0)){
    vector<int> x(n);
    int sum=0;
    for(int i=0;i<n;i++){
      cin >> x[i];
      sum += x[i];
    }

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

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

#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>

#include <numeric>
#include <algorithm>
#include <functional>

#include <cctype>

#include <complex>
#include <string>
#include <sstream>

using namespace std;

#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define rep(i,n) for(unsigned int i=0;i<(n);i++)
#define tr(it,container) for(typeof(container.begin()) it = container.begin(); \
                                                  it != container.end(); ++it)

typedef long long ll;
typedef complex<double> P;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,-1,0,1};
const double EPS = 1e-9;
const int days[] = {31,28,31,30,31,30,31,31,30,31,30,31};
const int daysleap[] = {31,29,31,30,31,30,31,31,30,31,30,31};

int main(){
    while(true){
        int N,M,P;
        cin >> N >> M >> P;
        if(N==0) break;
        vector<int> X(N);
        rep(i,N) cin >> X[i];
        int total = accumulate(all(X),0);
        double rest = 100 * total * ((100-P)/100.0);

        double ret = rest / X[M-1];
        if(X[M-1] == 0) ret = 0;
        cout << floor(ret) << endl;
    }
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        int n, m, p;
        cin >> n >> m >> p;
        if(n == 0)
            return 0;

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

        if(x[m-1] == 0){
            cout << 0 << endl;
        }else{
            int ret = accumulate(x.begin(), x.end(), 0);
            ret *= 100 - p;
            ret /= x[m-1];
            cout << ret << 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> X;
		int pool=0;
		for(int i=0,a;i<N;++i){
			cin >> a;
			X.push_back(a);
			pool += a;
		}
		cout<<((X[M-1]!=0)?pool*(100-P)/X[M-1]:0)<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#define pb(in,tmp) in.push_back(tmp)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) loop(i,0,b)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
int main(){
  int n,m,p;
  while(cin>>n>>m>>p,n||m||p){
    double ans=0;
	vector<int>in(n);
	rep(i,n){cin>>in[i];ans+=in[i];}
	if(!in[m-1])cout<<0<<endl;
	else{
	  ans*=100-p;
	  ans/=in[m-1];
	  cout<<(int)ans<<endl;
    }
  }
}