Snuke has a string x of length N. Initially, every character in x is `0`.

Snuke can do the following two operations any number of times in any order:

* Choose A consecutive characters in x and replace each of them with `0`.
* Choose B consecutive characters in x and replace each of them with `1`.



Find the number of different strings that x can be after Snuke finishes doing operations. This count can be enormous, so compute it modulo (10^9+7).

Constraints

* 1 \leq N \leq 5000
* 1 \leq A,B \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N A B


Output

Print the number of different strings that x can be after Snuke finishes doing operations, modulo (10^9+7).

Examples

Input

4 2 3


Output

11


Input

10 7 2


Output

533


Input

1000 100 10


Output

828178524
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<"  "
#define el <<endl
#define fgx cerr<<" ---------------------------------------------- "<<endl
#define LL long long
#define uint unsigned int 
#define ULL unsigned long long
#define LDB long double
#define DB double
#define pii pair<int,int>
#define pli pair<LL,int>
#define mp make_pair
#define pb push_back
using namespace std;
inline LL read(){
	LL nm=0; bool fh=true; char cw=getchar();
	for(;!isdigit(cw);cw=getchar()) fh^=(cw=='-');
	for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
	return fh?nm:-nm;
}
#define mod 1000000007
namespace  CALC{
	inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
	inline int mns(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
	inline int mul(LL x,LL y){return x*y%mod;}
	inline void upd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
	inline void dec(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
	inline int qpow(int x,int sq){int res=1;for(;sq;sq>>=1,x=mul(x,x))if(sq&1)res=mul(res,x);return res;}
}using namespace CALC;
#define M 5020
int n,A,B;
int con0[M],con1[M];
int F[M],G[M];
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=read(),A=read(),B=read(); if(A>B) swap(A,B);
	con0[0]=1;
	for(int i=1;i<=n;i++){
		con1[i]=add(con1[i-1],con0[i-1]);
		for(int z=A;z<=i;z++) upd(con0[i],con1[i-z]);
	}
	for(int i=1;i<B;i++) F[i]=add(con0[i],con1[i]);
	for(int i=1;i<A;i++) G[i]=1;
	int ans=F[n]; G[0]=1;
	for(int i=1;i<n;i++){
		if(n-i<A) upd(ans,F[i]);
		if(n-i<B) upd(ans,mul(G[i],add(con0[n-i],con1[n-i])));
		for(int k=1;i+k<=n&&k<B;k++) upd(F[i+k],mul(G[i],con1[k]));
		for(int k=1;i+k<=n&&k<A;k++) upd(G[i+k],F[i]);
	}
	ans=mns(qpow(2,n),ans);
	printf("%d\n",ans);
	return 0;
}