Consider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive).

There are K^N such sequences. Find the sum of \gcd(A_1, ..., A_N) over all of them.

Since this sum can be enormous, print the value modulo (10^9+7).

Here \gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ..., A_N.

Constraints

* 2 \leq N \leq 10^5
* 1 \leq K \leq 10^5
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N K


Output

Print the sum of \gcd(A_1, ..., A_N) over all K^N sequences, modulo (10^9+7).

Examples

Input

3 2


Output

9


Input

3 200


Output

10813692


Input

100000 100000


Output

742202979
import java.util.*;
import java.util.Map.Entry;
 
class Main {
	 static int mod =  (int) (Math.pow(10,9)+7);
   	 static List<ArrayList<Integer>> list= new ArrayList<ArrayList<Integer>>();
   	 static int a_dist[];
//	 static int mod = 998244353;
	 public static void main(String[] args) {
	        Scanner sc = new Scanner(System.in);
	        int N = sc.nextInt();
	        int K = sc.nextInt();
	        long[] mp= new long[K+5];
	        
	        long ans=0;

	        
	        mp[0]=1;
	        for(int i=2;i<=K;i++) {
	        	mp[i-1]=i;
	        	for(int j=1;(double)j<=Math.pow(i, 0.5);j++) {
	        		if(i%j==0) {
	        			mp[i-1]=mp[i-1]-mp[j-1];
	        			if(i/j>j&&i/j<i) {
	        				mp[i-1]=mp[i-1]-mp[i/j-1];
	        			}
	        		}
	        	}
	        }
	        for(int i=1;i<=K;i++) {
	        	long tmp=K/i;
	        	ans = (ans + (mp[i-1]*pow(tmp,N)%mod)%mod)%mod;
	        }
	    	System.out.println(ans);
	        
	        	        	        
	 }
		public static long pow(long a,long n) {
		    long res=1;
		    while (n>0) {
		        if ((n-n/2*2)==1) {
		            res=(res*a)%mod;
		        }
		        a=(a*a)%mod;
		        n>>=1;
		    }
		    return res;
		}
}
