#include<bits/stdc++.h>
using namespace std;

#define endl "\n"
#define ll long long

vector<int> check(string s, char aa){
	vector<int>a;
	int x = 0;
	int flag = 1;
	for(int i=6;;i++){
//		cout<<s[i]<<endl;
		if(s[i] == ')'){
			a.push_back(flag * x);
			break;
		}
		else if(s[i] == ','){
			a.push_back(flag * x);
			flag = 1;
			x = 0;
		}
		else if(s[i] == '-'){
			flag = -1;
		}
		else if(s[i] == aa){
			x = -1;
			flag = 1;
		}
		else {
			x = x * 10 + (s[i] - '0');
		}
	}
	
	if(a.size() == 2)a.push_back(1);
	return a;
}

void solve(){
	ll ans = 0;
	vector<string>s(20);
	for(int i=1;i<=11;i++)cin>>s[i];
	
	for(int i=4;i<s[1].size();i++){
		int x = s[1][i] - '0';
		ans = ans * 10 + x;
	}	
	
	char a = s[3][0], b = s[7][0];
	char add = s[10][ s[10].size() - 1 ];
	
	vector<int>opa = check(s[5], a);
	vector<int>opb = check(s[9], a);
//	cout<<s[5]<<endl;
//	for(auto &x:opa)cout<<x<<" ";
//	cout<<endl;
//	cout<<s[9]<<endl;
//	for(auto &x:opb)cout<<x<<" ";
//	cout<<endl;

	if(opa[2] < 0){
		opa[2] *= -1;
		swap(opa[0], opa[1]);
		opa[0] += 1;
		opa[1] += 1;
	}
	
	for(int i=opa[0]; i < opa[1];i += opa[2]){
		
//		cout<<"i = "<<i<<endl;
		
		int x = i;
		
//		if(add == b){
	
			if(opb[0] == -1){//起点取i 
				
				if(opb[2] < 0 && x <= opb[1] || opb[2] > 0 && x >= opb[1]){
					continue;
				}
				
				int l = i, r = opb[1], d = abs(opb[2]);
				int cnt = (abs(l - r) + d - 1) / d;
				 
				r = i + (cnt - 1) * opb[2];
				
//				cout<<"l = "<<l<<" r = "<<r<<endl;
				
				if(add == b)ans += 1ll * (l + r) * cnt / 2;
				else ans += 1ll * cnt * i;
				
			}
			
			else if(opb[1] == -1){//最值取i 
				
				x = opb[0];
				
				int l = opb[0], r = i, d = opb[2];
				int dd = abs(d);
				
				if(d < 0){
					r += 1;
				}
				else r -= 1;
				
				//[l, r]
				
				if(d < 0 && l < r || d > 0 && l > r)continue;
				
				int cnt = (abs(l - r + 1) + dd - 1) / dd;
				
				r = l + (cnt - 1) * d;
				
				if(add == b)ans += 1ll * (l + r) * cnt / 2;
				else ans += 1ll * cnt * i;
			}
			
			else if(opb[2] == -1){//d为i 
				
				int l = opb[0], r = opb[1], d = i;
				
				r -= 1;
				
				if(l > r)continue;
				
				int cnt = (r - l + 1 + d - 1) / d;
				
				r = l + (cnt - 1) * d;
				
				if(add == b)ans += 1ll * (l + r) * cnt / 2;
				else ans += 1ll * cnt * i;
				
			}
			
			else {
				
				int l = opb[0], r = opb[1], d = opb[2];
				int dd = abs(d);
				
				if(d < 0){
					r += 1;
				}
				else r -= 1;
				
				int cnt = (abs(l - r + 1) + dd - 1) / dd;
				
				r = l + (cnt - 1) * d;
				
//				cout<<"l = "<<l<<" r = "<<r<<" cnt = "<<cnt<<endl; 
				
				if(add == b)ans += 1ll * (l + r) * cnt / 2;
				else ans += 1ll * cnt * i;
			}
			
//		}
		
	}
	
	cout<<ans<<endl;
}

/*
ans=0
for q in range(1,5,1):
for i in range(3,q,1):
ans+=q
print(ans)
*/

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t = 1;
//	cin>>t;
	for(int i=1;i<=t;i++){
		solve();
	}
	return 0;
}