#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define int long long
#define INF 1e18
void parse(string s, int &a, int &b, int &c){
    int cnt = 0;
    bool oka = 0, okb = 0, okc = 0;
    int now = 1;
    for (int i = 1; i < s.size(); i++){
        if(s[i] == ',' || s[i] == ')'){
            int val;
            if(i - 1 == now && !('0' <= s[i - 1] && s[i - 1] <= '9'))
                val = INF;
            else
                val = stoi(s.substr(now, i - now));
            if(!oka)
                a = val, oka = 1;
            else if(!okb)
                b = val, okb = 1;
            else
                c = val, okc = 1;
            now = i + 1;
        }
    }
    if(!okc)
        c = 1;
}
int sum(int a, int b, int c){
    // cout << a << " " << b << " " << c << " ";
    int n = 0;
    if(c > 0){
        if(a >= b)
            return 0;
        for (int j = 1e9; j; j >>= 1){
            while(a + c * (n + j) < b)
                n += j;
        }
        // cout << n << "\n";
    }
    else{
        if(a <= b)
            return 0;
        for (int j = 1e9; j; j >>= 1){
            while(a + c * (n + j) > b)
                n += j;
        }
        // cout << n << "\n";        
    }
    n++;
    return (2 * a + (n - 1) * c) * n / 2;
}
void solve(){
    string s;
    cin >> s;
    cin.ignore();
    getline(cin, s);
    char f1 = s[4];
    int l, r;
    for (int i = 0; i < s.size(); i++){
        if(s[i] == '(')
            l = i;
        if(s[i] == ')')
            r = i;
    }
    s = s.substr(l, r - l + 1);
    int a, b, c;
    parse(s, a, b, c);
    // cout << a << " " << b << " " << c << "\n";
    getline(cin, s);
    for (int i = 0; i < s.size(); i++){
        if(s[i] == '(')
            l = i;
        if(s[i] == ')')
            r = i;
    }
    s = s.substr(l, r - l + 1);
    int d, e, f;
    parse(s, d, e, f);
    // cout << d << " " << e << " " << f << "\n";
    int ans = 0;
    if(c < 0){
        for (int i = a; i > b; i += c){
            int nd = (d == INF ? i : d);
            int ne = (e == INF ? i : e);
            int nf = (f == INF ? i : f);
            ans += sum(nd, ne, nf);
            // cout << ans << "\n";
        }
    }
    else{
        for (int i = a; i < b; i += c){
            int nd = (d == INF ? i : d);
            int ne = (e == INF ? i : e);
            int nf = (f == INF ? i : f);
            ans += sum(nd, ne, nf);
        }
    }
    cout << ans << "\n";
}
signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}