/**************************************************************

     Problem: 2154

     User: idy002

     Language: C++

     Result: Accepted

     Time:5584 ms

     Memory:157916 kb

 ****************************************************************/

 #include <cstdio>

 #include <iostream>

 #define M 20101009

 using namespace std;

 typedef long long dnt;

 int prm[], isnot[], mu[], ptot;

 dnt mds[];

 void init( int n ) {

     mu[] = ;

     for( int i=; i<=n; i++ ) {

         if( !isnot[i] ) {

             prm[++ptot] = i;

             mu[i] = -;

         }

         for( int j=; j<=ptot && i*prm[j]<=n; j++ ) {

             isnot[i*prm[j]] = true;

             if( i%prm[j]== ) {

                 mu[i*prm[j]] = ;

                 break;

             }

             mu[i*prm[j]] = -mu[i];

         }

     }

     for( dnt d=; d<=n; d++ ) {

         mds[d] = (mu[d]*d*d)%M;

         mds[d] += mds[d-];

         if( mds[d]>=M ) mds[d]-=M;

         if( mds[d]< ) mds[d]+=M;

     }

 }

 inline dnt S( dnt x, dnt y ) {

     return (((+x)*x/%M)*(((+y)*y)/%M)%M);

 }

 dnt F( dnt x, dnt y ) {

     if( x>y ) swap(x,y);

     dnt rt = ;

     for( dnt d=; d<=x; d++ ) {

         dnt dd = min( x/(x/d), y/(y/d) );

         rt += S(x/d,y/d) * (mds[dd]-mds[d-]) % M;

         if( rt< ) rt += M;

         if( rt>=M ) rt -= M;

         d = dd;

     }

     return rt;

 }

 dnt calc( dnt n, dnt m ) {

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

     dnt rt = ;

     for( dnt d=; d<=n; d++ ) {

         dnt dd=min( n/(n/d), m/(m/d) );

         rt += ((d+dd)*(dd-d+)/ % M) * F( n/d, m/d ) % M;

         if( rt< ) rt+=M;

         if( rt>=M ) rt-=M;

         d = dd;

     }

     return rt;

 }

 int main() {

     int n, m;

     scanf( "%d%d", &n, &m );

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

     init(n);

     printf( "%lld\n", calc(n,m) );

 }