Ayoub and Lost Array CodeForces - 1105C

Ayoub had an array a of integers of size n

and this array had two interesting properties:

• All the integers in the array were between l

and r

• (inclusive).
• The sum of all the elements was divisible by 3

• .

Unfortunately, Ayoub has lost his array, but he remembers the size of the array n

and the numbers l and r

, so he asked you to find the number of ways to restore the array.

Since the answer could be very large, print it modulo 109+7

(i.e. the remainder when dividing by 109+7). In case there are no satisfying arrays (Ayoub has a wrong memory), print 0

.

Input

The first and only line contains three integers n

, l and r (1≤n≤2⋅105,1≤l≤r≤109

) — the size of the lost array and the range of numbers in the array.

Output

Print the remainder when dividing by 109+7

the number of ways to restore the array.

Examples

Input

2 1 3

Output

3

Input

3 2 2

Output

1

Input

9 9 99

Output

711426616

Note

In the first example, the possible arrays are : [1,2],[2,1],[3,3]

.

In the second example, the only possible array is [2,2,2]

.确实没想到要用dp啊，还用深搜做了一遍超时了，

#include"cstdio"
#include"iostream"
#include"cstring"
#include"cmath"
#include"algorithm"
using namespace std;
long long yy[200005][5];
long long kk=1e9+7;
int main()
{
	int n , l , r;
	
	while(~scanf("%d %d %d",&n,&l,&r))
	{
		memset(yy,0,sizeof(yy));
		long long a,b,c;
		a=b=c=(r-l+1)/3;
		for(int i=0;i<(r-l+1)%3;i++)
		{
			if((i+l)%3==0) a++;
			if((i+l)%3==1) b++;
			if((i+l)%3==2) c++;
		}
		yy[1][0] = a , yy[1][1] = b , yy[1][2] = c;
		for(int i = 2 ; i <= n ; i ++)
		{
			yy[i][0] = (yy[i-1][0]*a%kk+yy[i-1][1]*c%kk+yy[i-1][2]*b%kk)%kk;
			yy[i][1] = (yy[i-1][0]*b%kk+yy[i-1][1]*a%kk+yy[i-1][2]*c%kk)%kk;
			yy[i][2] = (yy[i-1][0]*c%kk+yy[i-1][1]*b%kk+yy[i-1][2]*a%kk)%kk;
		}
		printf("%lld\n",yy[n][0]);
	}
	return 0; 
}