E. Different Subsets For All Tuplestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor a sequence a of n integers between 1 and m, inclusive, denote f(a) as the number of distinct subsequences of a (including the empty subsequence).You are given two positive integers n and m. Let S be the set of all sequences of length n consisting of numbers from 1 to m. Compute the sum f(a) over all a in S modulo 109 + 7.InputThe only line contains two integers n and m (1 ≤ n, m ≤ 106) — the number of elements in arrays and the upper bound for elements.OutputPrint the only integer c — the desired sum modulo 109 + 7.ExamplesInput1 3Output6Input2 2Output14Input3 3Output174
Input1 3
Output6
['combinatorics', 'math', '*2300']