#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#define ALL(v) v.begin(),v.end()
#define For(i,_) for(int i=0,i##end=_;i<i##end;++i) // [0,_)
#define FOR(i,_,__) for(int i=_,i##end=__;i<i##end;++i) // [_,__)
#define Rep(i,_) for(int i=(_)-1;i>=0;--i) // [0,_)
#define REP(i,_,__) for(int i=(__)-1,i##end=_;i>=i##end;--i) // [_,__)
typedef long long ll;
typedef unsigned long long ull;
#define V vector
#define pb push_back
#define pf push_front
#define qb pop_back
#define qf pop_front
#define eb emplace_back
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
#define fi first
#define se second
const int dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}},inf=0x3f3f3f3f,mod=1e9+7;
const ll infl=0x3f3f3f3f3f3f3f3fll;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
int init=[](){return cin.tie(nullptr)->sync_with_stdio(false),0;}();
int main(){
    int t_case=1;
    //scanf("%d",&t_case);
    while(t_case--){
        string s;
        V<char>t(30);
        For(_,5)cin>>s;
        sscanf(s.c_str(),"range(%[^)]",t.data());
        int a,b,c;
        if(count(ALL(t),',')==1){
            sscanf(t.data(),"%d,%d",&a,&b),c=1;
        }
        else if(count(ALL(t),',')==2){
            sscanf(t.data(),"%d,%d,%d",&a,&b,&c);
        }
        else assert(0);
        For(_,4)cin>>s;
        sscanf(s.c_str(),"range(%[^)]",t.data());
        int d,e,f;
        if(count(ALL(t),',')==1){
            For(i,t.size())if(islower(t[i])){
                if(i&&t[i-1]==',')sscanf(t.data(),"%d,%*[a-z]",&d),e=inf;
                else d=inf,sscanf(t.data(),"%*[a-z],%d",&e);
                goto skip1;
            }
            sscanf(t.data(),"%d,%d",&d,&e);
            skip1:;
            f=1;
        }
        else if(count(ALL(t),',')==2){
            For(i,t.size())if(islower(t[i])){
                if(i&&t[i-1]==','&&i+1<t.size()&&t[i+1]==',')sscanf(t.data(),"%d,%*[a-z],%d",&d,&f),e=inf;
                else if(i&&t[i-1]==',')sscanf(t.data(),"%d,%d,%*[a-z]",&d,&e),f=inf;
                else d=inf,sscanf(t.data(),"%*[a-z],%d,%d",&e,&f);
                goto skip2;
            }
            sscanf(t.data(),"%d,%d,%d",&d,&e,&f);
            skip2:;
        }
        else assert(0);
        int coef1=1,coef2=1;
        if(c<0)a=-a,b=-b,c=-c,coef1*=-1;
        if(f<0)d=-d,e=-e,f=-f,coef2*=-1;
        auto calc=[&](int l,int r,int k)->ll{
            if(l>=r)return 0;
            int c=(r-l-1)/k+1;
            return 1ll*c*l+1ll*c*(c-1)/2*k;
        };
        ll ans=0;
        for(int i=a;i<b;i+=c)ans+=calc(d==inf?coef1*i:d,e==inf?coef1*i:e,f==inf?coef1*i:f);
        printf("%lld\n",coef2*ans);
    }
    return 0;
}