def solve():
    m, n = map(int, input().split())
    maxn = 500005
    mod = 998244353
    fac = [0] * maxn
    nfac = [0] * maxn
    inv = [0] * maxn
    d = [0] * maxn
    f = [[] for _ in range(maxn)]
    dd = [[] for _ in range(maxn)]

    fac[0] = fac[1] = nfac[0] = nfac[1] = inv[1] = 1
    for i in range(2, maxn):
        fac[i] = (fac[i-1] * i) % mod
        inv[i] = mod - (mod // i) * inv[mod % i] % mod
        nfac[i] = (nfac[i-1] * inv[i]) % mod

    def C(a, b):
        return 0 if a < b else (fac[a] * nfac[b] * nfac[a-b]) % mod

    for i in range(1, m + 1):
        for j in range(i, m + 1, i):
            d[j] += 1
            if i != j:
                dd[j].append(i)
    
    ans = 0
    for i in range(1, m + 1):
        f[i] = [0] * (d[i] + 1)
        f[i][1] = 1
        for x in dd[i]:
            for k in range(1, d[x] + 1):
                f[i][k+1] = (f[i][k+1] + f[x][k]) % mod
        
        for j in range(1, min(d[i] + 1, n + 1)):
            ans = (ans + f[i][j] * C(m // i - 1, n - j)) % mod
    
    ans = (C(m, n) * n - ans + mod) % mod
    print(ans)

solve()