import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.StringTokenizer; public class Main { static BufferedReader in; static PrintWriter out; static StringTokenizer tok; void solve() throws IOException { int n = ni(); int l = ni(); cprime(); long ans = 0; for (int i = 0; i < 1000000; i++) { if (prime[i] * (n - 1) > l) { break; } ans += l - prime[i] * (n - 1) + 1; } out.println(ans); } int prime_max = 4000000; int pidx = 0; long[] prime = new long[1000000]; int[] divp = new int[prime_max]; void cprime() { for (long i = 2; i < prime_max; i++) { if (divp[(int)i] == 0) { prime[pidx++] = (int)i; for (long j = i * i; j < prime_max; j += i) { divp[(int)j] = (int)i; } } } } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }