Problem: It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has some amount of energy: the i-th accumulator has ai units of energy. Energy can be transferred from one accumulator to the other. Every time x units of energy are transferred (x is not necessarily an integer) k percent of it is lost. That is, if x units were transferred from one accumulator to the other, amount of energy in the first one decreased by x units and in other increased by <image> units.

Your task is to help Petya find what maximum equal amount of energy can be stored in each accumulator after the transfers.

Input

First line of the input contains two integers n and k (1 ≤ n ≤ 10000, 0 ≤ k ≤ 99) — number of accumulators and the percent of energy that is lost during transfers.

Next line contains n integers a1, a2, ... , an — amounts of energy in the first, second, .., n-th accumulator respectively (0 ≤ ai ≤ 1000, 1 ≤ i ≤ n).

Output

Output maximum possible amount of energy that can remain in each of accumulators after the transfers of energy.

The absolute or relative error in the answer should not exceed 10 - 6.

Examples

Input

3 50
4 2 1


Output

2.000000000


Input

2 90
1 11


Output

1.909090909

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Main {
	static Scanner sc = new Scanner(System.in);
	static int[] a;
	public static String tallestChimp(int h)
	{
		int f=0;
		int l=a.length-1;
		int mid=0;
		while(f<l)
		{
			mid=(f+l+1)/2;
			
			if(a[mid]<h)
			{
				f=mid;
			}
			else
			{
				l=mid-1;
			}
			
		}
		if(a[f]>=h)
		{
			return "X";
		}
		return a[f]+ "";
	}
	
	public static String shortestChimp(int h)
	{
		int f=0;
		int l=a.length-1;
		int mid=0;
		while(f<l)
		{
			mid=(f+l)/2;
			
			if(a[mid]>h)
			{
				l=mid;
			}
			else
			{
				f=mid+1;
			}
			
		}
		if(a[f]<=h)
		{
			return "X";
		}
		return a[f]+ "";
	}
	
	/*public static void main(String[] args) throws IOException{
		int N=sc.nextInt();
		a= new int[N];
		for (int i = 0; i < a.length; i++) {
			a[i]=sc.nextInt();
		}
		
		int Q=sc.nextInt();
		for (int i = 0; i < Q; i++) {
			int height=sc.nextInt();
			System.out.println(tallestChimp(height) + " " + shortestChimp(height));
			
		}
	}*/
	
	/*public static void main(String[] args) throws IOException {
		int N=sc.nextInt();
		int Q=sc.nextInt();
		int count=1;
		while(N!=0 && Q!=0)
		{
			System.out.println("CASE# "+ count + ":");
			int[] a= new int[N];
			
			for (int i = 0; i < a.length; i++) {
				a[i]=sc.nextInt();
			}
			Arrays.sort(a);
			
			for (int i = 0; i < Q; i++) {
				int temp=sc.nextInt();
				int f=0;
				int l=a.length-1;
				while (f<l) {
					int middle=(f+l)/2;
					if(a[middle]>temp)
					{
						l=middle-1;
					}
					else if(a[middle]==temp)
					{
						l=middle;
					}
					else
					{
						f=middle+1;
					}
					
				}
				if(a[f]!=temp)
				{
					System.out.println(temp + " not found");
				}
				else
				{
					f++;
					System.out.println(temp + " found at " + f);
				}
			}
			N=sc.nextInt();
			Q=sc.nextInt();
			count++;
		}
		
	}*/
	public static boolean nLines(int n, int v, int k)
	{
		long sum=0;
		long d=1;
		while(v/d!=0)
		{
			sum+=v/d;
			d*=k;
		}
		
		if(sum>=n)
		{
			return true;
		}
		return false;
	}
	/*public static void main(String[] args) throws IOException {
		int n=sc.nextInt();
		int k=sc.nextInt();
		
		int f=1;
		int l=n;
		while(f<l)
		{
			int middle=(f+l)/2;
			if(nLines(n,middle,k))
			{
				l=middle;
			}
			else
			{
				f=middle+1;
			}
				
		}
		System.out.println(f);
	}*/
	public static boolean canBuy(int k, int s)
	{
		Long[] b= new Long[a.length];
		for (int i = 0; i < b.length; i++) {
			b[i]=(long)(a[i]+(i+1)*k);
		}
		Arrays.sort(b);
		long sum=0;
		for (int i = 0; i < k; i++) {
			if(b[i]<0 || b[i]>s || b[i]+sum>s)
			{
				return false;
			}
			sum+=b[i];
		}
		if(sum<=s)
		{
			return true;
		}
		return false;
	}
	/*public static void main(String[] args) throws IOException {
		int n=sc.nextInt();
		int S=sc.nextInt();
		a=new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i]=sc.nextInt();
		}
		int f=0;
		int l=n;
		while(f<l)
		{
			int middle=(f+l+1)/2;
			if(canBuy(middle, S))
			{
				f=middle;
			}
			else
			{
				l=middle-1;
			}
		}
		System.out.print(f + " ");
		Long[] b= new Long[a.length];
		for (int i = 0; i < b.length; i++) {
			b[i]=(long) a[i]+(i+1)*f;
		}
		Arrays.sort(b);
		long sum=0;
		for (int i = 0; i < f; i++) {
			sum+=b[i];
		}
		System.out.println(sum);
	}*/
	
	/*public static void main(String[] args) throws IOException {
		int n=100000 ;
		int S=1000000000;
		a=new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i]=100000;
		}
		int f=0;
		int l=n;
		while(f<l)
		{
			int middle=(f+l+1)/2;
			System.out.println(f + " " + l);
			System.out.println("middle: " + middle);
			if(canBuy(middle, S))
			{
				f=middle;
			}
			else
			{
				l=middle-1;
			}
		}
		System.out.print(f + " ");
		Long[] b= new Long[a.length];
		for (int i = 0; i < b.length; i++) {
			b[i]=(long) a[i]+(i+1)*f;
		}
		Arrays.sort(b);
		long sum=0;
		for (int i = 0; i < f; i++) {
			sum+=b[i];
		}
		System.out.println(sum);
	}*/
	public static boolean fillContainers(int m, int size)
	{
		int curr=0;
		int nFilled=0;
		for (int i = 0; i < a.length; i++) {
			if(a[i]>size)
			{
				return false;
			}
			if(curr+a[i]<=size)
			{
				curr+=a[i];
			}
			else
			{
				nFilled++;
				curr=a[i];
			}
		}
		nFilled++;
		if(nFilled<=m)
		return true;
		return false;
	}
	/*public static void main(String[] args) throws IOException {
		int n=sc.nextInt();
		int m=sc.nextInt();
		
		while(true)
		{
			int sum=0;
			a=new int[n];
			
			for (int i = 0; i < a.length; i++) {
				a[i]=sc.nextInt();
				sum+=a[i];
			}
			
			int f=1;
			int l=sum;
			
			while(f<l)
			{
				int middle=(f+l)/2;
				if(fillContainers(m, middle))
				{
					l=middle;
				}
				else
				{
					f=middle+1;
				}
			}
			System.out.println(f);
			if(!sc.ready())
			{
				break;
			}
			n=sc.nextInt();
			m=sc.nextInt();
		}
		
	}*/
	
	public static void main(String[] args) throws IOException {
		int n=sc.nextInt();
		int k=sc.nextInt();
		
		double[] a= new double[n];
		
		for (int i = 0; i < a.length; i++) {
			a[i]=sc.nextDouble();
		}
		
		double f=0;
		double l=1000;
		
		for (int i = 0; i < 100; i++) {
			double middle=(f+l)/2;
			//System.out.println(f + " " + l);
			//System.out.println("middle: " + middle);
			double energy=0;
		
			for (int j = 0; j < a.length; j++) {
				if(a[j]-middle>0)
				{
					double x=a[j]-middle;
					energy+=x-(x*k)/100;
				}
				else
				{
					double x=a[j]-middle;
					energy+=x;
				}
			}
			//System.out.println("energy: " + energy);
			if(energy>0)
			{
				f=middle;
			}
			else
			{
				l=middle;
			}
		}
		System.out.println(f);
		//System.out.println(Arrays.toString(a));
	}
	
	static class Scanner {
		StringTokenizer st;
		BufferedReader br;
 
		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			int start = 0;
			boolean dec = false, neg = false;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
	}
}