//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 0.001;
const ld EPS2 = 1e-6;
const ld PI = acos(-1);
int mod = (int)998244353;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const ll kekmod = 1791791791;
const ll bestmod = 1148822869;
const int MAXN = 1e5 + 1;
int lp[MAXN];
int pr[MAXN];
int prs = 0;
int mob[MAXN];
int pref[MAXN];
ll binpow(ll a, ll b)
{
	ll res = 1;
	while (b)
	{
		if (b & 1)
		{
			res = (res * a) % MOD7;
		}
		a = (a * a) % MOD7;
		b >>= 1;
	}
	return res;
}
signed main()
{
	fastio();
	for (int i = 2; i < MAXN; ++i)
	{
		if (!lp[i])
		{
			lp[i] = i;
			pr[prs++] = i;
		}
		for (int j = 0; j < prs && pr[j] * i < MAXN && pr[j] <= lp[i]; ++j)
		{
			lp[i * pr[j]] = pr[j];
		}
	}
	mob[1] = 1;
	mob[0] = 1;
	for (int i = 2; i < MAXN; ++i)
	{
		mob[i] = mob[i / lp[i]] * (-1);
	}
	for (int i = 0; i < prs; ++i)
	{
		ll kek = 1ll * pr[i] * pr[i];
		for (ll now = 1ll * pr[i] * pr[i]; now < MAXN; now += kek) mob[now] = 0;
	}
	for (int i = 0; i < MAXN; ++i)
	{
		pref[i] = (i == 0 ? 0 : pref[i - 1]) + mob[i];
	}
	int n, k;
	cin >> n >> k;
	ll ans = 0;
	for (int gg = 1; gg <= k; ++gg)
	{
		int tk = k / gg;
		int kek;
		ll tans = 0;
		for (int dd = 1; dd <= tk; dd = kek + 1)
		{
			kek = (tk / (tk / dd));
			tans += 1ll * (pref[kek] - pref[dd - 1] +MOD7) * binpow(tk / dd, n)%MOD7;
			tans %= MOD7;
		}
		ans += tans * gg;
		ans %= MOD7;
	}
	cout << ans;
	sp;
}

Measured memory_bytes: 4404