Rohit travelled to America. On his return to India, he planned to bring some gadgets.
He has M gadgets that weigh from 1 to M. But when Rohit travels on an aeroplane, he is only allowed to carry a maximum weight of W. So, he wants to leave some of the gadgets which are already available in India and bring the maximum number of gadgets that are not available in India.
Write a program that reads the M gadgets, W weight limit and N space-separated weights of common gadgets available in India and prints the maximum number of unique gadgets that can be brought into India.
Input
The first line of input contains space-separated integers representing the number of gadgets M, the maximum weight limit W, and number of gadget weights N.
The second line of input contains N space-separated integers representing the weights of common gadgets available in India.