A-SOUL!
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

One day, when small Diana is on live, a Super Chat asks her a very strange question.

Super Chat tells her that a -length sequence of numbers is -good if and only if holds for , where is a constant.

Then Super Chat gives her numbers and a number . Diana needs to choose as many numbers as she can from and put them into a new sequnce(in any order), so that the new sequence is -good.


输入描述:

The first line gives you two integers  and , indicating the length of sequence and the constant.

The second line gives you  numbers .

输出描述:

Only a single integer shows the maximum number of numbers Diana can choose from the given numbers.
示例1

输入

复制
1 2
6

输出

复制
1
示例2

输入

复制
5 2
1 3 3 5 7

输出

复制
4

备注:

Subscribe Diana, Satisfy Desire!

贝拉kira https://space.bilibili.com/672353429/ 
嘉然今天吃什么 https://space.bilibili.com/672328094/ 
向晚大魔王 https://space.bilibili.com/672346917/ 
乃琳Queen https://space.bilibili.com/672342685/ 
珈乐Carol https://space.bilibili.com/351609538/