#include <iostream>

using namespace std;
int nrDiv(int n)
{
    int p = 0;
    while(n % 2 == 0)
    {
        n /= 2;
        p++;
    }
    int nr = p + 1;
    int d = 3;
    while(n > 1)
    {
        p = 0;
        if(d * d > n)
        {
            nr *= 2;
            break;
        }
        while(n % d == 0)
        {
            n /= d;
            p++;
        }
        if(p)
        {
            nr *= (p + 1);
        }
        d += 2;
    }
    return nr;
}
int main()
{
    int n, p, v[1001], nr[1001];
    cin>>n>>p;
    if(p == 1)
    {
        int maxim = 0, contor = 0;
        for(int i=1;i<=n;i++)
        {
            cin>>v[i];
            nr[i] = nrDiv(v[i]);
            maxim = max(maxim, nr[i]);
        }
        for(int i=1;i<=n;i++)
            if(nr[i] == maxim) contor++;

        cout<<contor - 1;

    }
    else
    {
        int maxim = 0;
        for(int i=1;i<=n;i++)
        {
            cin>>v[i];
            nr[i] = nrDiv(v[i]);
            maxim = max(maxim, nr[i]);
        }

        int i = 1;
        int k = 0, contor = 0;
        int st = -1, dr = -1, stOFICIAL = -1, drOFICIAL = -1;
        while(i <= n)
        {

            if(nr[i] == maxim)
            {
                k++;
                st = i;
                i++;
                while(nr[i] != maxim)
                {

                }
            }
            else
            {
                if(k>ma)
            }
        }
    }
}