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:
/*
 Author: sunits789
 Task: B062
 Lang: JAVA
 */
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.FileReader;


public class B062
{
	public static void main(String[] Args)
	{
		// String inputStream = "file.in";
		// String outputStream = "file.out";
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		// PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(outputStream)));
		CodeB062 solver = new CodeB062();
		solver.solve(1, in, out);
		out.close();
	}
}

class CodeB062
{
	public void solve(int testNumber, InputReader in, PrintWriter out)
	{
		int n=in.nextInt();
		int k=in.nextInt();
		k=100-k;
		double arr[]=new double[n];
		in.getArray(arr);
		Arrays.sort(arr);
		double min=arr[0];
		double max=arr[n-1];
		int minc=0;
		int maxc=0;
		for(int i=0;i<n;i++)
		{
			if(arr[i]==min)
			{
				minc++;
			}
			if(arr[i]==max)
			{
				maxc++;
			}
		}
		double minnext=0;
		double maxnext=0;
		if(minc!=n)
		{
			minnext=arr[minc];
			maxnext=arr[n-maxc-1];
		}
		while((minc+maxc)<=n)
		{
			double en=getEnergy(min,max,minc,maxc,minnext,maxnext,k,n);
			//System.out.println(minc+" "+maxc+" "+en);
			for(int i=0;i<minc;i++)
			{
				arr[i]+=(((double)k/(double)100)*en)*((double)maxc/(double)minc);
			}
			for(int i=0;i<maxc;i++)
			{
				arr[n-i-1]-=en;
			}
			min=arr[0];
			max=arr[n-1];
			minc=0;
			maxc=0;
			for(int i=0;i<n;i++)
			{
				if(arr[i]==min)
				{
					minc++;
				}
				if(arr[i]==max)
				{
					maxc++;
				}
			}
			if(minc!=n)
			{
				minnext=arr[minc];
				maxnext=arr[n-1-maxc];
			}
			//printArray(arr,out);
		}
		out.println(arr[0]);
	}
	
	public double getEnergy(double min,double max,int minc,int maxc,double minnext,double maxnext,int k,int n)
	{
		if((maxc+minc)!=n)
		{
			double en=max-maxnext;
			double inc=(((double)k/(double)100)*en)*((double)maxc/(double)minc);
			if((min+inc)>minnext)
			{
				inc=minnext-min;
				en=(((double)100/(double)k)*inc)*((double)minc/(double)maxc);
				//System.out.println("1");
				return en;
			}
			else
			{
				//System.out.println("2");
				return en;
			}
		}
		else
		{
			double en=(max-min)/((((double)maxc*(double)k)/((double)minc*(double)100))+1);
			return en;
		}
	}
	
	public void printArray(int arr[],PrintWriter out)
	{
		for(int i=0;i<arr.length;i++)
		{
			out.println(arr[i]);
		}
	}
	public void printArray(long arr[],PrintWriter out)
	{
		for(int i=0;i<arr.length;i++)
		{
			out.println(arr[i]);
		}
	}
	public void printArray(double arr[],PrintWriter out)
	{
		for(int i=0;i<arr.length;i++)
		{
			System.out.println(arr[i]);
		}
	}
	public void printArray(String arr[],PrintWriter out)
	{
		for(int i=0;i<arr.length;i++)
		{
			out.println(arr[i]);
		}
	}
}








class InputReader
{
	private BufferedReader reader;
	private StringTokenizer tokenizer;

	public InputReader(InputStream stream)
	{
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}

	public InputReader(String iFile)throws IOException
	{
		reader = new BufferedReader(new FileReader(iFile));
		tokenizer = null;
	}

	public String next()
	{
		while (tokenizer == null || !tokenizer.hasMoreTokens())
		{
			try
			{
				tokenizer = new StringTokenizer(reader.readLine());
			}
			catch (IOException e)
			{
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public int nextInt()
	{
		return Integer.parseInt(next());
	}

	public long nextLong()
	{
		return Long.parseLong(next());
	}

	public double nextDouble()
	{
		return Double.parseDouble(next());
	}
	
	public void getArray(int arr[])
	{
		for(int i=0;i<arr.length;i++)
		{
			arr[i]=nextInt();
		}
	}
	
	public void getArray(double arr[])
	{
		for(int i=0;i<arr.length;i++)
		{
			arr[i]=nextDouble();
		}
	}
	
	public void getArray(String arr[])
	{
		for(int i=0;i<arr.length;i++)
		{
			arr[i]=next();
		}
	}
	
	public void getArray2D(String arr[][])
	{
		for(int i=0;i<arr.length;i++)
		{
			for(int j=0;j<arr[i].length;j++)
			{
				arr[i][j]=next();
			}
		}
	}
	
	public void getArray2D(int arr[][])
	{
		for(int i=0;i<arr.length;i++)
		{
			for(int j=0;j<arr[i].length;j++)
			{
				arr[i][j]=nextInt();
			}
		}
	}
	
	public void getArray2D(double arr[][])
	{
		for(int i=0;i<arr.length;i++)
		{
			for(int j=0;j<arr[i].length;j++)
			{
				arr[i][j]=nextDouble();
			}
		}
	}
}