#include<bits/stdc++.h>
#define fi first
#define se second
#define ull unsigned long long
#define make make_pair
#define N 2000006
#define mod 1000000007
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,m,ans[N],f[N];
int add(int a,int b){return ((1ll*a+b)%mod+mod)%mod;}
int mul(int a,int b){return (1ll*a*b)%mod;}
signed main()
{
	n=read();m=read();int p=min(n,m);
	f[2]=1;f[1]=1;
	for(int i=3;i<=p;i++)f[i]=add(f[i-1],f[i-2]);
	for(int i=1;i<=p;i++)
	{
		int ans1=0,ans2=0;
		for(int j=i;j<=n;j+=i)ans1++;
		for(int j=i;j<=m;j+=i)ans2++;
		ans[i]=mul(ans1,ans2);
	}
	for(int i=p-1;i>=1;i--)
	{
		for(int j=i*2;j<=p;j+=i)
		ans[i]=add(ans[i],-1*ans[j]);
	}
	int sum=0;
	for(int i=1;i<=p;i++)sum=add(sum,mul(ans[i],f[i]));
	cout<<sum<<"\n";
	return 0;
}