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.io.PrintWriter;
public class Main{
  public static long mod=1000000007;
  public static long Hoku(long a, long b){
    if(b==0){return 1;}
    else if(b%2==0){
      long k =Hoku(a,b/2);
      return k*k%mod;}
    else{long t=Hoku(a,b-1);
         return t*a%mod;}
  }
  public static void main(String[] args){
    Scanner sc =new Scanner(System.in);
    long N=sc.nextLong();
    int K =sc.nextInt();
    sc.close();
    long P[]=new long[K+1];
    long x=0;
    for(int i=K;i>0;i--){
      long j=K/i;
       P[i]=Hoku(j,N);
      for(int l=2;l<=j;l++){
        P[i]=P[i]-P[i*l];}
      x=(x+i*P[i])%mod;}
    while(x<0){x=x+mod;}
    System.out.println(x);
  }
}