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])))
		}
	}
}

Python: while 1:
  N,M,P=map(int,input().split())
  if not N and not M and not P:break
  X=[int(input()) for _ in range(N)]
  if not X[M-1]:r=0
  else:r=int(sum(X)*100*(100-P)/100/X[M-1])
  print(r)

Python: while True:
    N,M,P=map(int,input().split())
    if N==M==P: break
    divSum=0
    for i in range(N):
        temp=int(input())
        divSum+=temp*100
        if i==M-1:
            numWin=temp
    divSum*=(100-P)/100
    if temp!=0:
        dividents=int(divSum/numWin)
    else: dividents=0
    print(dividents)

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

while True:
    N,M,P = map(int,input().split(" "))
    if N == 0 and M == 0 and P == 0:
        break
    count = 0
    for i in range(N):
        x = int(input())
        count += x
        if i + 1 == M:
            hitman = x
    if hitman == 0:
        print(0)
    else:
        print(int((count*100)*((100-P)/100)//hitman))

Python: def solve(N,M,P,Xs):
	if Xs[M-1] == 0:
		return 0
	total = sum([x*100 for x in Xs])
	total *= (100-P)/100
	return total / Xs[M-1]
	
def main():
	while True:
		N,M,P = map(int,input().split())
		if N == 0 and M == 0 and P == 0:
			return
		Xs = [int(input()) for _ in range(N)]
		print(int(solve(N,M,P,Xs)))

if __name__ == '__main__':
	main()

Python: while True:
    n, m, p = [int(i) for i in input().split()]
    if n == 0 and m == 0 and p == 0:
        break
    x = [int(input()) for i in range(n)]
    s = sum(x)
    print(s*(100 - p) // x[m - 1]) if x[m - 1] != 0 else print(0)

Python: while True:
    N,M,P=map(int,input().split())
    if N==M==P: break
    divSum=0
    for i in range(N):
        temp=int(input())
        divSum+=temp*100
        if i==M-1:
            numWin=temp
    divSum*=(100-P)/100
    if numWin!=0:
        dividents=int(divSum//numWin)
    else: dividents=0
    print(dividents)

Python: import math
while True:
    N,M,P=map(int,input().split())
    if N==M==P: break
    divSum=0
    for i in range(N):
        temp=int(input())
        divSum+=temp*100
        if i==M-1:
            numWin=temp
    divSum=int(divSum*(100-P)/100)
    if numWin!=0:
        dividents=math.floor(divSum/numWin)
    else: dividents=0
    print(dividents)

Python: while True :
	N, M, P = map(int, input().split())
	if(N == 0 and M == 0 and P == 0) :
		break
	else :
		X = list()
		for i in range(N) :
			x = int(input())
			X.append(x)
		top = X[M - 1]
		Sum = sum(X)
		all = Sum * (100 - P)
		if(top == 0) :
			print(0)
		else :
			ans = all // top
			print(ans)

Python: import math

while True:
    data = input().split()
    n, m ,p = int(data[0]),int(data[1]),int(data[2])
    if n == 0 and m == 0 and p == 0: break

    x = []
    pool = 0
    for i in range(n):
        bets = int(input())
        pool += bets * 100 
        x.append(bets)
    winner = m-1
    if x[winner] == 0:
        print(0)
    else:
        eps = 0.000000001
        ans = math.floor(pool*(1-p/100) + eps)
        ans = math.floor(ans / x[winner] + eps)
        print(ans)

Python: ansli=[]

while 1:
    a=input().split()
    if a[0]=="0" and a[1]=="0" and a[2]=="0":
        break
    for i in range(len(a)):
        a[i]=int(a[i])
    x=[]
    for i in range(a[0]):
        x.append(int(input()))

    sum0=0
    for i in x:
        sum0+=i
    sum=sum0*100*((100-a[2])/100)
    hit=x[a[1]-1]
    if hit==0:
        ansli.append(0)
    else:
        ansli.append(int(sum/hit))

for i in ansli:
    print(i)

Python: while 1:
    n, m, p = map(int, input().split())
    if n == 0:
        break

    vote = []
    for _ in range(n):
        vote.append(int(input()))

    total = sum(vote) * 100 * (100 - p) // 100
    if vote[m-1] == 0:
        print(0)
    else:
        print(total // vote[m-1])

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

while True:
    N,M,P = map(int,input().split(" "))
    if N == 0 and M == 0 and P == 0:
        break
    count = 0
    for i in range(N):
        x = int(input())
        count += x
        if i + 1 == M:
            hitman = x
    if hitman == 0:
        print(0)
    else:
        print(int((count)*((100-P))/hitman))

Python: import math
while True:
    N,M,P=map(int,input().split())
    if N==M==P: break
    divSum=0
    for i in range(N):
        temp=int(input())
        divSum+=temp*100
        if i==M-1:
            numWin=temp
    divSum*=(100-P)/100
    if numWin!=0:
        dividents=math.floor(divSum/numWin)
    else: dividents=0
    print(dividents)

Python: def solve(N,M,P,Xs):
	if N < M or Xs[M-1] == 0:
		return 0
	return (sum([x*100 for x in Xs]) * (1-P/100)) // Xs[M-1]
	
def main():
	while True:
		N,M,P = map(int,input().split())
		if N == 0 and M == 0 and P == 0:
			return
		Xs = [int(input()) for _ in range(N)]
		print(int(solve(N,M,P,Xs)))

if __name__ == '__main__':
	main()

Python: while 1:
	n,m,p=map(int,raw_input().split())
	if n==0:break
	x=[int(raw_input()) for i in range(n)]
	print (100-p)*sum(x)/x[m-1] if x[m-1]!=0 else 0

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

while True:
    N,M,P = map(int,input().split(" "))
    if N == 0 and M == 0 and P == 0:
        break
    count = 0
    for i in range(N):
        x = int(input())
        count += x
        if i + 1 == M:
            hitman = x
    if hitman == 0:
        print(0)
    else:
        print(int((count*100)*((100-P)/100)/hitman))

Python: while True:
    N, M, P = map(int, input().split())
    if N == 0 and M == 0 and P == 0:
        break
    X = [int(input()) for _ in range(N)]
    win = X[M - 1]
    if win == 0:
        print(0)
    else:
        print(int(round(sum(X) * 100 * (1 - P / 100) / win, 10)))

Python: #!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
import math


def solve(m, p, xs):
    total_prize = sum(xs) * (100 - p)
    number_of_winners = xs[m - 1]
    if not number_of_winners:
        return 0
    else:
        return math.floor(total_prize / number_of_winners)


if __name__ == "__main__":
    while True:
        n, m, p = map(int, input().split())
        if n == 0 and m == 0 and p == 0:
            break
        xs = array.array("H", (int(input()) for i in range(n)))
        print(solve(m, p, xs))

Python: #!/usr/bin/python
# -*- coding: utf-8 -*-
import math

while True:
    amount, number, per = map(int, input().split())
    if amount == 0 and number == 0 and per == 0:
        break

    vote = [int(input()) for i in range(amount)]
    # for _ in range(amount):
        # vote.append(int(input()))

    if vote[number-1] == 0:
        print("0")
    else:
        print(math.floor((100 * sum(vote) * ((100 - per) / 100)) / vote[number-1]))

Python: ansli=[]
sum=0

while 1:
    a=input().split()
    if a[0]=="0" and a[1]=="0" and a[2]=="0":
        break
    for i in range(len(a)):
        a[i]=int(a[i])
    x=[]
    for i in range(a[0]):
        x.append(int(input()))

    sum0=0
    for i in x:
        sum0+=i
    sum=sum0*100*((100-a[2])/100)
    hit=x[a[1]-1]
    if hit==0:
        ansli.append(0)
    else:
        ansli.append(int(sum/hit))

for i in ansli:
    print(i)

Python: result_all = []
counter = 0
while True:
    N,M,P = map(int, input().split())
    if(N == 0 and M == 0 and P == 0): break
    X = [int(input()) for i in range(N)]
    X_sum = sum(X)
    if(X[M-1] == 0):
        result_all.append(0)
        continue
    result = ((X_sum * 100) - ((X_sum * 100) * (P / 100))) / X[M-1]
    result_all.append(result)

for i in range(len(result_all)):
    print(int(result_all[i]))