#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;


int p[10000000] = {0};

int main() {
    long long N,L;
    cin >> N >> L;

    for ( long long i = 2; i <= L; i++ ) {
        if ( p[i] == 0 ) {
            for ( int j = i*2; j <= L; j += i ) {
                p[j] = 1;
            }
        }
    }

    long long ans = 0;
    for ( long long i = 2; i <= L; i++ ) {
        if ( p[i] == 0 && i*(N-1) <= L ) {
            ans += L-i*(N-1)+1;
        }
    }
    cout << ans << endl;

    return 0;
}