#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

vector<string> split(string s){
    int pos = 0;
    size_t nxt;
    vector<string> ans;
    while((nxt = s.find(',', pos)) != string::npos){
        ans.push_back(s.substr(pos, nxt - pos));
        pos = nxt + 1;
    }
    ans.push_back(s.substr(pos));
    return ans;
}

LL get(LL a, LL b, LL c){
    if (c > 0){
        b -= 1;
        if (a > b) return 0;
        b = a + (b - a) / c * c;
        return (a + b) * ((b - a) / c + 1) / 2;
    }
    else{
        b += 1;
        if (a < b) return 0;
        b = a - (a - b) / (-c) * (-c);
        return (a + b) * ((a - b) / (-c) + 1) / 2;
    }
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    string s;
    getline(cin, s);
    getline(cin, s);
    int pos = s.find('(');
    s = s.substr(pos + 1);
    s.pop_back();
    s.pop_back();
    auto v1 = split(s);
    if (v1.size() == 2) v1.push_back("1");
    int a = stoi(v1[0]);
    int b = stoi(v1[1]);
    int c = stoi(v1[2]);
    getline(cin, s);
    pos = s.find('(');
    s = s.substr(pos + 1);
    s.pop_back();
    s.pop_back();
    auto v2 = split(s);
    if (v2.size() == 2) v2.push_back("1");
    LL ans = 0;
    if (c > 0){
        for(int i = a; i < b; i += c){
            auto f = [&](string s){
                if (isalpha(s[0])){
                    return i;
                }
                return stoi(s);
            };

            ans += get(f(v2[0]), f(v2[1]), f(v2[2]));
        }
    }
    else{
        for(int i = a; i > b; i += c){
            auto f = [&](string s){
                if (isalpha(s[0])){
                    return i;
                }
                return stoi(s);
            };
            ans += get(f(v2[0]), f(v2[1]), f(v2[2]));
        }
    }
    cout << ans << '\n';

}