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

#define ll long long

const int inf=1e9;

char a[100];
char b[100];
char c[100];

ll solve(int l,int r,int k)
{
	if(k>0)
	{
		r--;
		if(l>r) return 0;	
		int num=(r-l)/k+1;
		return 1ll*(l+l+k*(num-1))*num/2;
	}
	if(k<0)
	{
		r++;
		if(l<r) return 0;
		int num=(l-r)/(-k)+1;
		return 1ll*(l+l+k*(num-1))*num/2;	
	}
}

int main()
{
	scanf("%*s");
	char ch;int l1,r1,k1=1;
	scanf(" for %*c in range(%d,%d%c",&l1,&r1,&ch);
	if(ch==')') scanf(":");	
	else scanf("%d):",&k1);
	int l2=inf,r2=inf,k2=inf;
	scanf(" for %*c in range(%[^,],%[^,)]%c",a,b,&ch);
	if(ch==')') k2=1;
	else scanf("%[^)]):",c);
	if(isdigit(a[0])||a[0]=='-') sscanf(a,"%d",&l2);
	if(isdigit(b[0])||b[0]=='-') sscanf(b,"%d",&r2);
	if(isdigit(c[0])||c[0]=='-') sscanf(c,"%d",&k2);
	ll ans=0;
	if(k1>0)
	{
		for(int i=l1;i<r1;i+=k1)
		{
			int l3=l2==inf?i:l2;
			int r3=r2==inf?i:r2;
			int k3=k2==inf?i:k2;
			ans+=solve(l3,r3,k3);
		}
	}
	else
	{
		for(int i=l1;i>r1;i+=k1)
		{
			int l3=l2==inf?i:l2;
			int r3=r2==inf?i:r2;
			int k3=k2==inf?i:k2;
			ans+=solve(l3,r3,k3);	
		}
	}
	printf("%lld\n",ans);
	return 0;	
}