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 LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,n) for(int i=(int)(n-1);i>=0;--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(a) ((int)(a).size())
#define BIT(x, i) (((x) >> (i)) & 1)
#define SQ(x) ((x)*(x))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int main() {
    int N, M, P;
    while (cin >> N >> M >> P, N|M|P) {
        M--;
        int cnt = 0;
        int win = 0;
        REP(i, N) {
            int a;
            cin >> a;
            cnt += a;
            if (i == M) win = a;
        }
        if (win > 0) {
            cout << floor((double)(100*cnt - P*cnt) / (double)win) << endl;
        } else {
            cout << 0 << endl;
        }
    }
}

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;

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

  int n,m,p;
  int player[101];
  while(true){
    int ans;
    cin >> n >> m >> p;
    if(n==0) break;
    int voter=0;
    for(int i=1;i<=n;i++){
      int x;
      cin >> x;
      player[i] = x;
      voter += x;
    }
    if(player[m]==0) ans=0;
    else ans = voter*(100-p)/player[m];
    cout << ans  << endl;
  }
}

C++: #include <iostream>

using namespace std;

int main(void){
	while(1){
		int n, m, p; cin >> n >> m >>p;
		if(!n && !m && !p) break;
		m--;
		int sum = 0;
		int win = 0;
		for(int i=0; i<n; i++){
			int x; cin >> x;
			sum += x;
			if(i == m) win = x;
		}
		if(win == 0){
			cout << 0 << endl;
			continue;
		}
		int ans = sum*(100-p);
		ans /= win;
		cout << ans << endl;
	}
	return 0;
}

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];
    }
    cout << int(( pool / x[m-1]) * (100-p))<<endl;
  }
  return 0;
}

C++: ///
// File:  2018.cpp
// Author: ymiyamoto
//
// Created on Fri Nov 10 07:57:38 2017
//

#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

int32_t main()
{
  while (true) {
    uint32_t N, M, P;
    cin >> N >> M >> P;
    if (N == 0) break;

    vector<uint32_t> nums;
    uint32_t num = 0;
    for (uint32_t i = 0; i < N; i++) {
      uint32_t val;
      cin >> val;
      nums.push_back(val);
      num += val;
    }

    uint32_t total = num * 100 * (100 - P) / 100;
    if (nums[M - 1] == 0) {
      cout << 0;
    } else {
      cout << total / nums[M - 1];
    }
    cout << endl;
  }

  return 0;
}

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() {

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

	return 0;
}

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

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

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

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

using namespace std;

typedef long long ll;
typedef ll li;
typedef pair<int,int> PI;
#define EPS (1e-10L)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(),a.end()
#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)
void pkuassert(bool t){t=1/t;};

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

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