import java.util.*;

class Main {
        public static int[] prime = new int[10000000];
        public static void main(String args[]) {
                boolean[] f = new boolean[1000001];
                f[0] = true; f[1] = true;
                int idx = 0;
                for (int i = 2; i < 1000001; i++) {
                        if (!f[i]) {
                                int j = 2;
                                prime[idx] = i;
                                idx++;
                                while (i * j < 1000001) {
                                        f[i * j] = true;
                                        j++;
                                }
                        }
                }
                while (idx < 10000000) {
                        prime[idx] = 1 << 25;
                        idx++;
                }

                try (Scanner sc = new Scanner(System.in)) {
                        int N = sc.nextInt(), K = sc.nextInt(), ans = 0;
                        System.out.println(saiki(N, K, 1, 0));
                }
        }
        public static int saiki(int N, int K, int now, int nowidx) {
                int ret = 0;
                if (K <= 0 && now <= N) {
                        ret++;
                } else if(now > N) {
                        return 0;
                }
                for (int i = nowidx; now * prime[i] <= N; i++) {
                        int idx = 1;
                        while (now * pow(prime[i], idx) <= N) {
                                ret += saiki(N, K - 1, now * pow(prime[i], idx), i + 1);
                                idx++;
                        }
                }
                return ret;
        }
        public static int pow(int N, int M) {
                int ret = 1;
                for (int i = 0; i < M; i++) {
                        ret *= N;
                }
                return ret;
        }
}