import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, M = map(int, input().split())
mod = 10 ** 9 + 7


def divs(n):
    d = []
    for i in range(1, n + 1):
        if i * i > n:
            break
        if i * i == n:
            d.append(i)
            break
        if n % i == 0:
            d.append(i)
            d.append(n // i)
    return sorted(d)


D = divs(M)
idx = {}
for i, n in enumerate(D):
    idx[n] = i
ds = []
for d in D:
    ds.append([idx[n] for n in divs(M // d)])

dp = [[0 for _ in range(len(D))] for _ in range(N + 1)]
for j in range(len(D)):
    dp[1][j] = 1
for i in range(1, N):
    for j in range(len(D)):
        for k in ds[j]:
            dp[i + 1][k] += dp[i][j]
            dp[i + 1][k] %= mod
print(sum(dp[N]) % mod)