#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

#define MAXN 100005
#define MOD 1e9+7
using namespace std;
typedef long long ll;

int n,k;
ll a[MAXN];

int main()
{
	int i,j;
	scanf("%d%d",&n,&k);
	for(i=0;i<n;i++)
		scanf("%lld",&a[i]);
		
	vector<ll>v;
	for(i=1;i<=k;i++)
	{
		for(j=0;j<n;j++)
			if(a[j]%i==0)
				v.push_back(1ll*a[j]/i);
	}
	
	sort(v.begin(),v.end());
//	cout<<v.size()<<endl;
	
	ll time=1,maxt=1;
	for(i=1;i<v.size();i++)
	{
		if(v[i]==v[i-1])
		{
			time++;
			if(time>maxt)
				maxt=time;
		}else
			time=1;
//		cout<<maxt<<' '<<v[i]<<endl;
	}
	printf("%lld",maxt);
	return 0;
}