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.*;
import java.util.*;
import java.math.*;

public class ACM
{
	static int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999};
	static int[][] matrix;
	public static void main(String[] args) 
	{
		Scanner keyboard = new Scanner(System.in);
		final int MOD = 1000000007;
		int n = keyboard.nextInt();
		int k = keyboard.nextInt();
		matrix = new int[n+1][k+1];
		for(int i=0;i<=n;i++)
			Arrays.fill(matrix[i], -1);
		int ans = 0;
		for(int i=1;i<=n;i++)
			ans=(ans+compute(n, i, k))%1000000007;
		System.out.println(ans);
	}
	public static int compute(int n, int start, int k)
	{
		if(k<2)
			return 1;
		if(matrix[start][k]!=-1)
			return matrix[start][k];
		int ans = 0;
		for(int i=1;i*start<=n;i++)
		{
			//System.out.println("\t Number of sequences of length " + (k-1) + " starting with " + (i*start));
			ans=(ans+compute(n, i*start, k-1))%1000000007;
		}
		matrix[start][k]=ans;
		//System.out.println("Number of sequences of length " + k + " starting with " + start + "=" + ans);
		return ans;
	}
}
	/*public static int numFactors(int x)
	{
		if(x==1)
			return 0;
		for(int i=0;i<primes.length;i++)
		{
			if(x%primes[i]==0)
				return 1+numFactors(x/primes[i]);
		}
		return 0;
	}
	public static HashSet<Integer> uniqueFactors(int x)
	{
		if(x==1)
		{
			HashSet<Integer> set = new HashSet<Integer>();
			return set;
		}
		for(int i=0;i<primes.length;i++)
		{
			if(x%primes[i]==0)
				return numFactors(x/primes[i]).add(i);
		}
	}
	
	public static int pow(int a, int b)
	{
		int ans= 1;
		for(int i=0;i<b;i++)
			ans=ans*a;
		return ans;
	}
}
		/*long possible[] = new long[n+1];
		for(int i=n;i>0;i--)
		{
			int j=n;
			long total = 1;
			while(j>0)
			{
				if(i*j<=n)
					total= (total + possible[i*j]) % MOD;
				j--;
			}
			possible[i]=total;
		}
		long ans = 0;
		for(int i=1;i<=n;i++)
			ans=(ans+possible[i])%MOD;
		System.out.println(ans);*/