Everyone knows what the Fibonacci sequence is. This sequence can be defined by the recurrence relation:

We'll define a new number sequence A_i(k) by the formula:

In this problem, your task is to calculate the following sum: A₁(k) + A₂(k) + ... + A_n(k). The answer can be very large, so print it modulo 1000000007 (10⁹ + 7).

The first line contains two space-separated integers n, k (1 ≤ n ≤ 10¹⁷; 1 ≤ k ≤ 40).

Print a single integer — the sum of the first n elements of the sequence A_i(k) modulo 1000000007 (10⁹ + 7).