import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;


void main() {
    int n, k;
    scan(n, k);

    auto dp = new long[](2*n + 1);

    foreach (b ; 1 .. n + 1) {
        if (b <= k) continue;
        for (int r = b; r <= 2*n; r += b) {
            dp[r - (b - k)]++;
            dp[r]--;
        }
        debug {
            writeln(b, ":", dp);
        }
    }

    foreach (i ; 1 .. n + 1) {
        dp[i] += dp[i - 1];
    }

    debug {
        writeln(dp);
    }

    long ans;

    foreach (i ; 1 .. n + 1) {
        ans += dp[i];
    }

    writeln(ans);
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
