## https://yukicoder.me/problems/no/866


class BinaryIndexTree:
    """
    フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス
    """
    def __init__(self, size, mod):
        self.size = size
        self.array = [0] * (size + 1)
        self.mod = mod
    
    def add(self, x, a):
        index = x
        while index <= self.size:
            self.array[index] += a
            self.array[index] %= self.mod
            index += index & (-index)
    
    def sum(self, x):
        index = x
        ans = 0
        while index > 0:
            ans += self.array[index]
            ans %= self.mod
            index -= index & (-index)
        return ans

    def least_upper_bound(self, value):
        if self.sum(self.size) < value:
            return -1
        elif value <= 0:
            return 0

        m = 1
        while m < self.size:
            m *= 2

        k = 0
        k_sum = 0
        while m > 0:
            k0 = k + m
            if k0 < self.size:
                if k_sum + self.array[k0] < value:
                    k_sum += self.array[k0]
                    k += m
            m //= 2
        if k < self.size:
            return k + 1
        else:
            return -1


def main():
    N, P = map(int, input().split())

    # イベント派生
    events = [[] for _ in range(N + 1)]
    for p in range(1, N + 1):
        x = p
        while x <= N:
            events[x].append(p)
            x += p
            
    bit = BinaryIndexTree(N, P)
    dp = [0] * (N + 1)
    prevs = [-1] * (N + 1)
    for p in range(3, N + 1):
        cnt = len(events[p])

        for x in events[p]:
            if prevs[x] == -1:
                continue
            bit.add(prevs[x], -dp[prevs[x]])

        inv_nx = pow(p - cnt, P - 2, P)
        dp[p] = (inv_nx * bit.sum(p - 1)) % P
        dp[p] += (p * inv_nx) % P
        dp[p] %= P

        for x in events[p]:
            prevs[x] = p
            bit.add(p, dp[p])

    print(dp[N])


if __name__ == "__main__":
    main()