//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	ci N=10000005;

	int n,m,K;
	vector<int> d[N];
	ll ans;
	void dfs(int i,int j){
		if(i>K||j>K)return ;
		ans+=(m-j)/(2*i)+1;
		if(i<=m)for(int k=j;k<=n;k+=2*i)if(i*2<=k)dfs(k,i);	
	}
	void mian(){
		cin>>n>>m,K=max(n,m);
		ans=m/2;

		for(int i=2;i<=n;i+=2)d[i].push_back(1+(i&1));

		for(int i=2;i<=n;i+=2)dfs(i,1);
		//set<pii> res;
		//for(int i=2;i<=n;i++){
		//	if(i%4!=3){
		//		for(int j:d[i]){
		//			ans+=(m-j)/(2*i)+1;
		//			if(i<=m)for(int k=j;k<=n;k+=2*i)if(i*2<=k)d[k].push_back(i);
		//		}
		//	}
		//}
		cout<<ans<<endl;

		//for(int i=2;i<=n;i++)for(int j:d[i])cout<<i<<' '<<j<<endl;
		//for(int i=2;i<=m;i+=2)cout<<"1 "<<i<<endl;
		//for(pii i:res)cout<<i.fi<<' '<<i.se<<endl;
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	//freopen("out.out","w",stdout);
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	cerr<<1.0*clock()/CLOCKS_PER_SEC<<endl;
	return 0;
}