#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}

vec<ll> primes(ll x)
{
    vec<ll> ans;
    ll i = 2;
    while(x>1) {
        if (x%i == 0) ans.push_back(i);
        while(x%i == 0) x/= i;
        i++;
    }
    return ans;
}

ll coun(vec<ll> &p, vec<ll> &primes)
{
    // dbg(primes, p);
    ll sum = 0, k = 1;
    For(i, 0, 1 << sz(primes))
    {
        ll t = 1;
        k = -1;
        For(j, 0, sz(primes)) if(i & (1 << j))
        {
            t *= primes[j];
            k *= -1;
        }
        if(t == 1) continue;
        sum += k*p[t];
        // dbg(t, k);
    }
    // dbg(sum);
    return sum;
}

void solve(){
    ll n, k, res = 0;
    cin >> n >> k;
    vec<ll> v(n);
    for(ll &x : v) cin >> x;

    ll l = 0, r = 0, t  = 0;
    vec<ll> p(723456, 0);

    while(1)
    {
        // For(i, 0, 5) cerr << (p[i]);
        // cerr << endl;
        // dbg(t ,res);
        // dbg(l, r);
        if(t < k){
            if(r+1 > n) break;
            auto pr = primes(v[r++]);
            t += coun(p, pr);
            // dbg(coun(p, pr));
            For(i, 0, 1 << sz(pr))
            {
                ll akt = 1;
                For(j, 0, sz(pr)) if(i & (1 << j)) akt *= pr[j];
                if(akt == 1) continue;

                p[akt]++;
            }
            if (t >= k) res+=n-r+1;
        }
        else {
            auto pr = primes(v[l++]);
            For(i, 0, 1 << sz(pr))
            {
                ll t = 1;
                For(j, 0, sz(pr)) if(i & (1 << j)) t *= pr[j];
                if(t == 1) continue;

                p[t]--;
            }
            t -= coun(p, pr);
            if (t >= k) res+=n-r+1;
        }
    }

    cout << res << '\n';

}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t = 1;
    while(t--)solve();
    return 0;
}