#include <iostream>
#include <vector>

using namespace std;

#define MOD 1000000007

long long llpow(long long x, long long n) {
	if (!n) return 1;
	if (n & 1) return llpow(x * x % MOD, n >> 1) * x % MOD;
	return llpow(x * x % MOD, n >> 1);
}

int main() {
	int n, k; cin >> n >> k;
	vector<long long> cnt(k + 1);
	for (int i = 1; i <= k; ++i) cnt[i] = llpow(k / i, n);
	for (int i = k / 2; i > 0; --i)
		for (int j = i * 2; j <= k; j += i)
			cnt[i] = (cnt[i] - cnt[j] + MOD) % MOD;
	long long ans = 0;
	for (int i = 1; i <= k; ++i) (ans += cnt[i] * i % MOD) %= MOD;
	cout << ans << endl;

	return 0;
}