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:
//package com.morazow.cf;

import java.util.*;

public class CF414B {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int MOD = 1000000007;

        int N = scanner.nextInt();
        int K = scanner.nextInt();
        int[][] ways = new int[2][N + 1];

        for (int i = 1; i <= N; i++) {
            ways[0][i] = 1;
        }

        int currRow = 0;
        for (int k = 2; k <= K; k++) {
            int nextRow = currRow ^ 1;
            Arrays.fill(ways[nextRow], 0);
            for (int i = 1; i <= N; i++) {
                for (int j = i; j <= N; j += i) {
                    ways[nextRow][i] += ways[currRow][j];
                    ways[nextRow][i] %= MOD;
                }
            }
            currRow = nextRow;
        }

        int result = 0;
        for (int i = 1; i <= N; i++) {
            result = (result + ways[currRow][i]) % MOD;
        }

        System.out.println(result);
    }

}