#include <bits/stdc++.h>

using namespace std;

#define int long long
#define deg( x ) cout<<""#x"="<<x<<endl
#define endl '\n'
#define pll pair<int,int>
#define se second
#define fr first

const int N=1e5+10;

struct node{
    string a ;
    string st , en , ad;
};

node get( string s ){
    //cout<<s<<endl;

    string a;

    int i=0;

    while( s[ i ]==' ' ) i++;

    i+=4;

    while( s[ i ]!=' ' ){
        a+=s[ i ];
        i++;
    }

    while( s[ i ]!='(' ) i++;

    i++;

    string st;
    while( s[ i ]!=',' ){
        st+=s[ i ];
        i++;
    }

    i++;

    string en;
    while( s[ i ]!=')' && s[ i ]!=',' ){
        en+=s[ i ];
        i++;
    }

    string ad="1";

    if( s[ i ]==',' ){
        i++;

        ad.clear();

        while( s[ i ]!=')' ){
            ad+=s[ i ];
            i++;
        }
    }

    return { a , st , en , ad };
}

int toint( string s ){

    int f=1;
    int re=0;

    for( auto x:s ){
        re*=10;
        if( x=='-' ) f=-1;
        else re+=x-'0';
    }
    return re*f;
}

int huo( int st , int en , int ad ){
    //cout<<st<<" "<<en<<endl;
    int re=0;

    if( st > en && ad > 0 ) return 0;
    if( st < en && ad < 0 ) return 0;

    int k=( en-st )/ad;

    int mo=st+k*ad;

    int o=mo+st;
    o*=( k+1 );
    o/=2;

    //cout<<o<<endl;

    return o;
}

void solve(){
    string s;
    getline( cin , s );

    int ans=0;
    getline( cin , s );
    node a=get( s );

    getline( cin , s );
    node b=get( s );

    int add=toint( a.ad );
    if( add > 0 ) {
        for (int i = toint(a.st); i < toint(a.en); i += toint(a.ad)) {
            int st, en, ad;
            if (b.st == a.a) st = i;
            else st = toint(b.st);

            if (b.en == a.a) en = i;
            else en = toint(b.en);

            if (b.ad == a.a) ad = i;
            else ad = toint(b.ad);

            ans += huo(st, en+( ad>0?-1:1 ), ad);
        }
    }
    else{
        for (int i = toint(a.st); i > toint(a.en); i += toint(a.ad)) {
            int st, en, ad;
            if (b.st == a.a) st = i;
            else st = toint(b.st);

            if (b.en == a.a) en = i;
            else en = toint(b.en);

            if (b.ad == a.a) ad = i;
            else ad = toint(b.ad);

            ans += huo(st, en+( ad>0?-1:1 ), ad);
        }
    }

    //cout<<a.a<<" "<<a.st<<" "<<a.en<<" "<<a.ad<<endl;
    //cout<<b.a<<" "<<b.st<<" "<<b.en<<" "<<b.ad<<endl;
    cout<<ans<<endl;
}

signed main() {
    //ios::sync_with_stdio( 0 );
    //cout.tie( 0 ); cin.tie( 0 );

    int T=1;
    //cin>>T;

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

    return 0;
}