#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s;
    cin >> s;
    ll ans = 0;
    //2
    rep(i,4) cin >> s;
    int x = 0, y = 0;
    while(s[6+x]!=',') ++x;
    ll a, b, c = 1, d = -1, e = -1, f = 1;
    a = stoi(s.substr(6,x));
    ++x;
    while(s[6+x+y]!=',' && s[6+x+y]!=')') ++y;
    b = stoi(s.substr(6+x,y));
    if(s[6+x+y]==','){
        x += y+1;
        y = 0;
        while(s[6+x+y]!=')') ++y;
        c = stoi(s.substr(6+x,y));
    }
    //3
    rep(i,4) cin >> s;
    bool cd = false, ce = false, cf = false;
    x = 0, y = 0;
    if('a'<=s[6] && s[6]<='z') cd = true, x += 1;
    else{
        while(s[6+x]!=',') ++x;
        d = stoi(s.substr(6,x));
    }
    ++x;
    if('a'<=s[6+x] && s[6+x]<='z') ce = true, x += 1;
    else{
        while(s[6+x+y]!=',' && s[6+x+y]!=')') ++y;
        e = stoi(s.substr(6+x,y));
    }
    if(s[6+x+y]==','){
        x += y+1, y = 0;
        if('a'<=s[6+x] && s[6+x]<='z') cf = true, x += 1;
        else{
            while(s[6+x+y]!=')') ++y;
            f = stoi(s.substr(6+x,y));
        }
    }

    if(c>0){
        for(;a<b;a+=c){
            ll p = (cd?a:d), q = (ce?a:e), r = (cf?a:f), z = 1;
            if(r<0) p *= -1, q *= -1, r *= -1, z = -1;
            ll t = max<ll>(0, (q-p+r-1)/r);
            ans += z * (p+p+r*(t-1))*t/2;
        }
    }else{
        for(;a>b;a+=c){
            ll p = (cd?a:d), q = (ce?a:e), r = (cf?a:f), z = 1;
            if(r<0) p *= -1, q *= -1, r *= -1, z = -1;
            ll t = max<ll>(0, (q-p+r-1)/r);
            ans += z * (p+p+r*(t-1))*t/2;
        }
    }
    cout << ans << '\n';
    return 0;
}