#include <bits/stdc++.h>
using namespace std;

const int MAXN = 3e5;
vector<int> a(MAXN + 1, 0);

void TP() {
    for (int i = 1; i <= MAXN; ++i) {
        for (int j = i; j <= MAXN; j += i) {
            a[j]++;
        }
    }
}

int main() {
    freopen("divi.inp","r",stdin);
    freopen("divi.out","w",stdout);
    int n, k;
    cin >> n >> k;
    TP();
    long long dem = 0;
    for (int x = 1; x <= n; ++x) {
        for (int y = x; y <= n; ++y) {
            if (k * a[x] * a[y] == x * y){
                dem++;
            }
        }
    }
    cout << dem << endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main() {
    freopen("coor.inp","r",stdin);
    freopen("coor.out","w",stdout);
    string s;
    cin>>s;
    int x=0,y=0;
    for(char c:s) {
        if(c=='E'){
            x++;
        }else if(c=='S'){
            y--;
        }else if(c=='W'){
            x--;
        }else if(c=='N'){
            y++;
        }
    }
    cout<<x<<" "<<y<<endl;
    return 0;
}