#include<bits/stdc++.h>
using namespace std;
const int N=10000005;
int n,m;
long long ans;
vector <int> hav[N];
void update(int x,int y)
{
    for(int i=y;i<=n;i+=x*2) hav[i].push_back(x);
}
void calc(int x,int y)
{
    // printf("%d %d\n",x,y);
    if(y<=n) ans+=(n-y)/(2*x)+1;
    if(y<=m) ans+=(m-y)/(2*x)+1;
}
int main()
{
    scanf("%d%d",&n,&m);
    hav[1].push_back(0);
    for(int i=1;i<=n;i++)
    {
        // cerr<<i<<" "<<hav[i].size()<<endl;
        for(int j=0;j<hav[i].size();j++)
        {
            int now=hav[i][j];
            calc(i,now+i*2);
            update(i,now+i*2);
        }
        hav[i].clear();
    }
    printf("%lld\n",ans);
}