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.util.HashMap;
import java.util.Scanner;
import java.util.ArrayList;

public class Solution{
    static int mod = 1000000007;
    public static int solve(HashMap<Integer , ArrayList<Integer>> map , int idx , int k , int prev , int dp[][]){
        
        if(idx == k){
            return 1;
        }

        if(dp[idx][prev] != 0) return dp[idx][prev];

        int count = 0;
        
        for(int i : map.get(prev)){
            count = (count%mod + solve(map , idx+1 , k , i , dp)%mod)%mod;
        }
        if(count < 0) count += mod;
        return dp[idx][prev] = (count + mod)%mod;
    }

    public static void main(String args[]){
        Scanner scn = new Scanner(System.in);
        int n = scn.nextInt();
        int k = scn.nextInt();

        // int arr[] = new int[n+1];
        HashMap<Integer , ArrayList<Integer>> map = new HashMap<>();
        for(int i = 1 ; i <= n ; i++){
            map.put(i , new ArrayList<>());
        }
        for(int i = 1 ; i < n+1 ; i++){
            for(int j = i ; j < n+1 ; j++){
                if(j%i == 0){
                    map.get(i).add(j);
                }
            }
        }

        int dp[][] = new int[2001][2001];

        int a = solve(map, 0, k, 1, dp);

        System.out.println(a);




    }
}