#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> A >> B; ll ans=0; for(i=A;i<=B;i++){ if(g(i)) ans+=i*i*i-i*i+i+1; } cout << ans << endl; return 0; }