import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } double euDist(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return sqrt(cast(double)c.sum); } double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; } double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); } double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; } long mod = 10^^9 + 7; //long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } long compress(in long[] arr, out long[long] zip, out long[] unzip) { auto index = MAKE_IDX(arr); long last = arr[index[0]], x; zip[last] = x; unzip ~= last; foreach (i; index[1..$]) { if (arr[i] == last) continue; last = arr[i]; ++x; zip[last] = x; unzip ~= last; } return x+1; } void main() { auto N = RD; auto M = RD; bool[long] set; for (long i = 1; i*i <= M; ++i) { if (M % i) continue; set[i] = true; set[M/i] = true; } auto keys = set.keys; debug writeln(keys); long[long] zip; long[] unzip; auto len = compress(keys, zip, unzip); auto edges = new long[][](len); foreach (i; 0..len) { auto x = unzip[i]; foreach (j; i..len) { auto y = unzip[j]; if (set.get(x*y, false)) { edges[i] ~= j; if (i != j) edges[j] ~= i; } } } debug writeln(edges); auto dp = new long[][](N, len); dp[0][] = 1; foreach (i; 0..N-1) { foreach (j; 0..len) { foreach (v; edges[j]) { dp[i+1][v].moda(dp[i][j]); } } } //debug writeln(dp); long ans; foreach (e; dp[N-1]) ans.moda(e); writeln(ans); stdout.flush; debug readln; }