#include <bits/stdc++.h>
using namespace std;

#define fast_io                  \
    ios::sync_with_stdio(false); \
    cin.tie(nullptr);

void solve()
{

    int a, b;
    cin >> a >> b;
    vector<int> prime(101, 1);
    for (int i = 2; i * i <= 100; i++)
    {
        if (prime[i] == 1)
        {
            for (int j = i * i; j <= 100; j += i)
            {
                prime[j] = 0;
            }
        }
    }
    prime[1] = 0;
    int sum = 0;
    if (max(a, b) == 1)
    {
        cout << 0 << endl;
    }

    else
    {
        for (int i = min(a, b); i <= max(a, b); i++)
        {
            if (prime[i] == 1)
            {
                int tempsum = 0;
                for (int j = 3; j >= 0; j--)
                {
                    if (j == 3)
                        tempsum += i * i * i;
                    else if (j == 2)
                        tempsum -= i * i;
                    else if (j == 1)
                        tempsum += i;
                    else if (j == 0)
                        tempsum += 1;
                }
                sum += tempsum;
            }
        }
        cout << sum << endl;
    }
}

int main()
{
    fast_io;

    int t = 1;
    // cin >> t; // Uncomment if multiple test cases

    while (t--)
    {
        solve();
    }

    return 0;
}