Problem: Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.

A sequence of l integers b1, b2, ..., bl (1 ≤ b1 ≤ b2 ≤ ... ≤ bl ≤ n) is called good if each number divides (without a remainder) by the next number in the sequence. More formally <image> for all i (1 ≤ i ≤ l - 1).

Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007 (109 + 7).

Input

The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).

Output

Output a single integer — the number of good sequences of length k modulo 1000000007 (109 + 7).

Examples

Input

3 2


Output

5


Input

6 4


Output

39


Input

2 1


Output

2

Note

In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].

Solution (in JAVA):

Solution:
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Scanner;
public class Solution {
    static Scanner sc = new Scanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    public static void solve(int c, int n, int k) {
        long[][] dp = new long[n + 1][k + 1];
        for (int i = 1; i <= n; i ++){
            dp[i][1] = 1;
            for (int j = 1; j < k; j ++){
                for (int a = i; a <= n; a += i){
                    dp[a][j + 1] += dp[i][j];
                    dp[a][j + 1] %= 1000000007;
                }
            }
        }
        long sum = 0;
        for (int i = 1; i <= n; i ++){
            sum += dp[i][k];
            sum %= 1000000007;
        }
        pw.println(sum);
    }

//    public static int getMax(int[] arr){
//        int max = Integer.MIN_VALUE;
//        for (int i = 0; i < arr.length; i ++){
//            max = Math.max(max, arr[i]);
//        }
//        return max;
//    }

    public static void main(String[] args) {
        int t = 1;
        for (int i = 0; i < t; i ++){
            int n = sc.nextInt();
            int k = sc.nextInt();
            solve(i + 1, n, k);
        }
        pw.close();
    }
}










//    public static void floodfill(char[][] arr, boolean[][] visited, int row, int col){
//        visited[row][col] = true;
//        if (row != 0){
//            if (arr[row - 1][col] == '#' && !visited[row - 1][col]){
//                floodfill(arr, visited, row - 1, col);
//                visited[row - 1][col] = true;
//            }
//        }
//        if (row != arr.length - 1){
//            if (arr[row + 1][col] == '#' && !visited[row + 1][col]){
//                floodfill(arr, visited, row + 1, col);
//                visited[row + 1][col] = true;
//            }
//        }
//        if (col != 0){
//            if (arr[row][col - 1] == '#' && !visited[row][col - 1]){
//                floodfill(arr, visited, row, col - 1);
//                visited[row][col - 1] = true;
//            }
//        }
//        if (col != arr[0].length - 1){
//            if (arr[row][col + 1] == '#' && !visited[row][col + 1]){
//                floodfill(arr, visited, row, col + 1);
//                visited[row][col + 1] = true;
//            }
//        }
//    }