#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

vector<string> parse(string s){
	while (!s.empty() && s[0] == ' ') s.erase(s.begin());
	while (!s.empty() && s.back() == ' ') s.pop_back();
	vector<string> res;
	string t;
	int cnt = 0;
	forn(i, s.size()){
		if (s[i] == ' ' || s[i] == '(' || s[i] == ',' || s[i] == ')'){
			++cnt;
			if (cnt == 2 || cnt == 5 || cnt == 6 || cnt == 7)
				res.push_back(t);
			t = "";
		}
		else{
			t += s[i];
		}
	}
	if (res.size() != 4){
		assert(res.size() == 3);
		res.push_back("1");
	}
	return res;
}

int eval(string a, string b, int val){
	return a == b ? val : stoi(a);
}

bool ok(int i, int r, int s){
	if (s > 0)
		return i < r;
	return i > r;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;
	getline(cin, s);
	getline(cin, s);
	auto ss = parse(s);
	getline(cin, s);
	auto tt = parse(s);
	int L = stoi(ss[1]);
	int R = stoi(ss[2]);
	int S = stoi(ss[3]);
	long long ans = 0;
	for (int i = L; ok(i, R, S); i += S){
		int lf = eval(tt[1], ss[0], i);
		int rg = eval(tt[2], ss[0], i);
		int st = eval(tt[3], ss[0], i);
		int coef = 1;
		if (st < 0){
			lf = -lf;
			rg = -rg;
			st = -st;
			coef = -1;
		}
		rg -= 1;
		if (lf <= rg){
			int fst = lf;
			int cnt = (rg - lf) / st;
			int lst = fst + cnt * st;
			ans += coef * ((fst + lst) * 1ll * (cnt + 1) / 2);
		}
	}
	cout << ans << '\n';
}