#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e7+1;
int n,m,tot,pri[N],vis[N],phi[N];
ll s[N];
void prework(){
    for(int i=2;i<N;i++){
        if(!vis[i]) vis[i] = 1,pri[++tot] = i,phi[i] = i-1;
        for(int j=1;j<=tot && 1ll*pri[j]*i<N;j++){
            vis[pri[j]*i] = 1;
            if(i%pri[j]==0){
                phi[i*pri[j]] = pri[j]*phi[i];
                break;
            }
            phi[i*pri[j]] = phi[pri[j]]*phi[i];
        }
    }
}
int f(int i,int j){
    if(i==0 && j==1) return 1; 
    if(__gcd(i,j)!=1) return 0;
    if(2*i<=j) return f(j-(j/(2*i))*2*i,i);
    else if(i>=2*j) return f(i-(i/(2*j))*2*j,j);
    return 0;
}
int main(){
    // cin.tie(0),cout.tie(0);
    // ios::sync_with_stdio(0);
    // prework();
    cin >> n >> m;
    int ans = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=i/2;j++){
            ans = (ans+f(i,j));
        }
        for(int j=2*i;j<=m;j++){
            ans = (ans+f(i,j));
        }
    }
    // cout << f(2,1) << ' ' << f(4,1) << ' ' << f(6,1) << ' ' << f(8,1) << ' ' << f(10,1) << " " << f(5,2) << ' ' << f(9,2) << ' ' << f(9,4) << '\n';
    cout << ans;
    return 0;
}