import static java.util.Comparator.comparing;

import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==========================================================
    final long MOD = 1000000007;
    long[] A, wa;
    public void solve() {
    	int N = ni();
    	long P = nl();
    	A = new long[N+1];
    	wa = new long[N+2];
    	A[0] = 0;  A[1] = 1;
    	wa[1] = 0; wa[2] = 1;
    	for (int i = 2; i <= N; i++) {
			A[i] = ((P * A[i-1])% MOD + A[i-2])% MOD;
			wa[i+1] = (wa[i] + A[i]) % MOD;
//			out.println("A[" + i + "] = " + A[i]);
//			out.println("wa[" + (i+1) + "] = " + wa[i+1]);
		}
    	long ans = 0;
    	for (int i = 0; i < N; i++) {
			ans = (ans + (A[i] * wa[i+1]) % MOD) % MOD;
//			out.println("ans = " + ans + "  A[" + i + "] = " + A[i]
//					+ "  wa[" + (i+1) + "] = " + wa[i+1]);
		}
    	out.println(ans);
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}