import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N,P=map(int,readline().split())
mod=10**9+7
A=[None]*N
A[0]=0
if N>=1:
    A[1]=1
for i in range(2,N):
    A[i]=P*A[i-1]%mod+A[i-2]
    A[i]%=mod
ans=(sum(A)**2%mod+sum(a**2%mod for a in A))*(1+mod)//2%mod
print(ans)