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 CPP):

Solution:
#include <bits/stdc++.h>
long long int memory[2001][2001];
long long int multiple(long long int j, long long int n, long long int k);
int main() {
  long long int n, k, arr[1002], i, temp1 = 0;
  scanf("%lld %lld", &n, &k);
  for (i = 1; i <= n; i++) {
    temp1 += multiple(i, n, k - 1) % 1000000007;
  }
  printf("%lld\n", temp1 % 1000000007);
  return 0;
}
long long int multiple(long long int j, long long int n, long long int k) {
  int i;
  long long int temp = 0;
  if (k == 0) {
    return 1;
  } else if (j > n)
    return 0;
  else if (memory[j][k] != 0)
    return memory[j][k];
  else {
    for (i = 1; i <= n / j; i++) {
      memory[j * i][k - 1] = multiple(j * i, n, k - 1) % 1000000007;
      temp += memory[j * i][k - 1];
    }
    return temp % 1000000007;
  }
}