#include<fstream>
#include<deque>
#include<algorithm>
using namespace std;
deque <int> A;
int main()
{
    ifstream in("input.txt");
    ofstream out("output.txt");
    int n, k, tmp;
    in>>n>>k;
    for(int i=0;i<n;i++)
    {
        in>>tmp;
        A.push_back(tmp);
    }
    sort(A.begin(), A.end());
    int soluzioni=0;
    while(A.size()>1)
    {
        if(A.front()*A.back()>k)
            A.pop_back();
        else if(A.front()*A.back()==k)
        {
            soluzioni++;
            A.pop_front();
        }
        else A.pop_front();
    }
    out<<soluzioni;
}