F. Senioritis
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The seniors of Cupertino Competitive Programming Club are going through terrible senioritis! If their GPA gets below $$$2.8$$$, they may just abandon the club altogether!!! Thankfully, you recently discovered a potion for senioritis... but it takes a long time to work, only works on one person at a time, and will only improve the senior's GPA by $$$1.0$$$.

Given the amount of time the potion takes to work, the amount of time you have to cure their senioritis, and a list of GPAs, please output the least amount of people who will be unable to be cured of their senioritis.

Input

The first line contains two number $$$m$$$ and $$$k$$$ which represent the amount of time the potion takes to work and the amount of time you have to cure their senioritis respectively. The second line contains contains $$$n$$$, the number of seniors you have to cure. The next $$$n$$$ lines contain a single number $$$a_i$$$, $$$0 \le a_i \le 5$$$ which represents the gpa of the $$$i$$$th senior.

Output

The output should be exactly one number representing the least amount of people who will be unable to be cured of their senioritis.

Example
Input
5 21
6
1.7
3.9
4
2.6
0.7
2.4
Output
1
Note

In the above example, you know that the potion takes $$$5$$$ units of time to make, and you have $$$21$$$ units of time to cure all the seniors. The $$$1.7$$$ GPA is atrocious, so you could choose to try to cure that first, taking away ($$$2$$$ uses of the potion) $$$\cdot$$$ ($$$5$$$ units of time) $$$= 10$$$ units of time used -> $$$11$$$ units left. Then you could get the $$$2.6$$$ GPA up to $$$3.6$$$, but you'd only have 6 units of time left and would be able to cure the $$$2.4$$$ GPA, but not the $$$0.7$$$.