You are given two integers n and k.

You need to construct k regular polygons having same [circumcircle](https://en.wikipedia.org/wiki/Circumscribed_circle), with distinct number of sides l between 3 and n. 

<image> Illustration for the first example.

You can rotate them to minimize the total number of distinct points on the circle. Find the minimum number of such points.

Input

The only line of input contains two integers n and k (3 ≤ n ≤ 10^{6}, 1 ≤ k ≤ n-2), the maximum number of sides of a polygon and the number of polygons to construct, respectively.

Output

Print a single integer — the minimum number of points required for k polygons.

Examples

Input


6 2


Output


6


Input


200 50


Output


708

Note

In the first example, we have n = 6 and k = 2. So, we have 4 polygons with number of sides 3, 4, 5 and 6 to choose from and if we choose the triangle and the hexagon, then we can arrange them as shown in the picture in the statement.

Hence, the minimum number of points required on the circle is 6, which is also the minimum overall possible sets.
import java.io.*;
import java.util.*;

public class Codeforces1208G {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());

		if (k == 1) {
			System.out.println(3);
		}
		else {
			int[] phitable = new int[n+1];
			for (int i = 1; i <= n; i++) {
				phitable[i] += i;
				for (int j = 2; j <= n/i; j++) {
					phitable[i*j] -= phitable[i];
				}
			}
			
			sort(phitable);
			long ans = 0;
			for (int i = 1; i <= (k+2); i++) {
				ans += (long) phitable[i];
			}
			System.out.println(ans);
		}
		
	}
	
	public static void sort(int[] array) {
    	int N = array.length;
    	if (N != 1) {
    		int[] firstHalf = Arrays.copyOfRange(array, 0, N/2);
    		sort(firstHalf);
        	int[] secondHalf = Arrays.copyOfRange(array, N/2, N);
        	sort(secondHalf);
        	int firstCounter = 0;
        	int secondCounter = 0;
        	for (int i = 0; i < N; i++) {
        		if (firstCounter == N/2) {
        			array[firstCounter+secondCounter] = secondHalf[secondCounter];
        			secondCounter++;
        		}
        		else if ((secondCounter == N-N/2) || firstHalf[firstCounter] <= secondHalf[secondCounter]) {
        			array[firstCounter+secondCounter] = firstHalf[firstCounter];
        			firstCounter++;
        		}
        		else {
        			array[firstCounter+secondCounter] = secondHalf[secondCounter];
        			secondCounter++;
        		}
        	}
    	}	
    }	

}