numereX

#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("numere.in");
ofstream fout("numere.out");
int P, n, Div[N], m, t, a, b, maxim, nrmaxim;
int mdiv[N], lmd;
long long ok;
void findDivisors(int n)
{
    for(int i = 2; i <= n; i++)
        for(int j = 2; j * i <= n; j++)
            Div[i * j]++;
    for(int i = 4; i <= n; i++)
        if(maxim < Div[i])
        {
           maxim=Div[i];
           nrmaxim=i;
        }
}
int main()
{
    fin>>P>>n;
    findDivisors(n);
    if(P==1)
    {
        fout<<nrmaxim;
        return 0;
    }
    fin>>m>>t;
    for(int i=1; i<=n; i++)
        if(Div[i]==t)
            mdiv[++lmd]=i;
    mdiv[lmd+1]=n+1;
    for(int i=m; i<=lmd; i++)
        ok=ok+1LL*(mdiv[i+1]-mdiv[i])*(mdiv[i-m+1]-mdiv[i-m]);
    fout<<ok;
    return 0;
}