require 'prime'
# n の因数を列挙した配列を返す
def factors(n)
n.prime_division.inject([1]) do |a, (q, e)|
a.product((0..e).to_a).map {|x, k| x * q ** k}
end
end
# Π(1-q) (q は x の素因数)
def f(x)
x.prime_division.inject(1) {|prod, (q, e)| prod * (1 - q)}
end
# Σf(x)m(m+1)/2 (x は k の因数, m = floor(n/x))
def F(n, k)
factors(k).inject(0) do |s, x|
m = n / x
s + m * (m + 1) / 2 * f(x)
end
end
n, k = gets.split.map(&:to_i)
p F(n, k)
cmVxdWlyZSAncHJpbWUnCgojIG4g44Gu5Zug5pWw44KS5YiX5oyZ44GX44Gf6YWN5YiX44KS6L+U44GZCmRlZiBmYWN0b3JzKG4pCiAgbi5wcmltZV9kaXZpc2lvbi5pbmplY3QoWzFdKSBkbyB8YSwgKHEsIGUpfAogICAgYS5wcm9kdWN0KCgwLi5lKS50b19hKS5tYXAge3x4LCBrfCB4ICogcSAqKiBrfQogIGVuZAplbmQKCiMgzqAoMS1xKSAgKHEg44GvIHgg44Gu57Sg5Zug5pWwKQpkZWYgZih4KQogIHgucHJpbWVfZGl2aXNpb24uaW5qZWN0KDEpIHt8cHJvZCwgKHEsIGUpfCBwcm9kICogKDEgLSBxKX0KZW5kCgojIM6jZih4KW0obSsxKS8yICAoeCDjga8gayDjga7lm6DmlbAsIG0gPSBmbG9vcihuL3gpKQpkZWYgRihuLCBrKQogIGZhY3RvcnMoaykuaW5qZWN0KDApIGRvIHxzLCB4fAogICAgbSA9IG4gLyB4CiAgICBzICsgbSAqIChtICsgMSkgLyAyICogZih4KQogIGVuZAplbmQKCm4sIGsgPSBnZXRzLnNwbGl0Lm1hcCgmOnRvX2kpCnAgRihuLCBrKQ==