# Precise Average

Time limit: 0.08s Memory limit: 64MB Input: Output:

Your friend John works at a shop that sells $N$ types of products, numbered from $0$ to $N-1$.
Product $i$ has a price of $P_i$ bytedollars, where $P_i$ is a positive integer.

The government of Byteland has created a new law for shops. The law states that the average of the prices of all products in a shop should be exactly $K$, where $K$ is a positive integer.
John's boss gave him the task to change the prices of the products so the shop would comply with the new law.

He has lots of other stuff to do, so he asked you for help: what is the minimum number of products whose prices should be changed?
A product's price can be changed to any positive integer amount of bytedollars.

## Input data

The first line of the input contains two integers $N$ and $K$.
The next line contains $N$ positive integers, $P_{0}, \, \ldots, \, P_{N-1}$.

## Output data

Output a single integer between $0$ and $N$, inclusive: the answer to the question.
It can be proven that it is always possible to change the prices of some products so that the new prices comply with the law.

## Constraints and clarifications

• $1 \le N \le 200 \ 000$.
• $1 \le K \le 10^6$.
• $1 \le P_i \le 10^6$ for each $i=0\ldots N-1$.
• For tests worth $20$ points, $N \le 2$.
• For tests worth $20$ more points, $N \le 1000$.

## Example 1

stdin

2 3
10 6


stdout

2


### Explanation

In the first sample case a possible solution is to change both prices to be $3$ bytedollars. It can be proven that changing only one price is not sufficient.

## Example 2

stdin

3 9
2 10 1


stdout

1


### Explanation

In the second sample case a possible solution is to change the first product's price to $16$ bytedollars, thus the average will be $\frac{16+10+1}{3}=9$.