#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 10000000+5

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)

 #define for5(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)

 #define mod 20101009

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }

 int p[maxn],tot,mu[maxn];

 bool v[maxn];

 void get(int m)

 {

     mu[]=;

     for2(i,,m)

     {

         if(!v[i])p[++tot]=i,mu[i]=-;

         for1(j,tot)

         {

             int k=i*p[j];

             if(k>m)break;

             v[k]=;

             if(i%p[j])mu[k]=-mu[i];

             else {mu[k]=;break;}

         }

     }

     for1(i,m)mu[i]=((ll)mu[i]*i%mod*i%mod+mu[i-])%mod;

 }

 inline int sum(int n,int m)

 {

     return ((ll)n*(n+)/%mod)*((ll)m*(m+)/%mod)%mod;

 }

 inline int f(int n,int m)

 {

     int ret=;

     if(n>m)swap(n,m);

     for(int i=,j;i<=n;i=j+)

     {

         j=min(n/(n/i),m/(m/i));

         ret=(ret+(ll)(mu[j]-mu[i-])*sum(n/i,m/i)%mod)%mod;

     }

     return ret;

 }

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

         int n=read(),m=read(),ans=;get(m);

         if(n>m)swap(n,m);

         for(int i=,j;i<=n;i=j+)

         {

             j=min(n/(n/i),m/(m/i));

             ans=(ans+(ll)(i+j)*(j-i+)/%mod*f(n/i,m/i)%mod)%mod;

         }

         printf("%d\n",(ans+mod)%mod);

     return ;

 }