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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.concurrent.PriorityBlockingQueue;

import javax.swing.ComboBoxEditor;

public class aa {
	public static class node {
		int ch;
		int index;

		node(int ch, int index) {
			this.ch = ch;
			this.index = index;
		}
	}

	public static int dp[][];
	public static int n;
	public static int k;
	public static int mod = 1000000007;

	public static int solve(int i, int num) {
		if (i == k)
			return 1 % mod;

		if (dp[i][num] != -1)
			return dp[i][num] % mod;
		int a = 0;
		for (int j = num; j <= n; j+=num) {
			
				a = (a % mod + solve(i + 1, j) % mod) % mod;
		}
		dp[i][num] = a % mod;
		return a % mod;

	}

	public static void main(String[] args) throws IOException {

		// System.out.println(prime.size());
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		StringBuilder q = new StringBuilder();
		String y[] = in.readLine().split(" ");
		n = Integer.parseInt(y[0]);
		k = Integer.parseInt(y[1]);
		dp = new int[2005][2005];
		for (int i = 0; i < 2005; i++) {
			for (int j = 0; j < 2005; j++) {
				dp[i][j] = -1;
			}
		}
		System.out.println(solve(0, 1));

		out.close();

	}
}