#include <bits/stdc++.h>

using namespace std;

#define int long long

string s;

void trim()
{
  while (s[0] == ' ')
    s.erase(s.begin());
}
string parse(string token)
{
  if (!s.starts_with(token))
    assert(false);
  s.erase(s.begin(), s.begin() + token.size());
  return token;
};
string parseVar()
{
  string token = string(s.begin(), s.begin() + 1);
  s.erase(s.begin());
  return token;
};
int parseNum()
{
  if (!isdigit(s[0]) && s[0] != '-')
  {
    s.erase(s.begin());
    return INT_MAX;
  }
  bool neg = s[0] == '-';
  if (neg)
    s.erase(s.begin());
  auto token = 0;
  while (isdigit(s[0]))
  {
    token = token * 10 + (s[0] - '0');
    s.erase(s.begin());
  }
  if (neg)
    token = -token;
  return token;
};

int32_t main()
{
  cin.tie(0)->sync_with_stdio(0);

  string i, j;
  int a, b, c, d, e, f;

  int answer = 0;
  for (int iteration = 0; iteration < 5; ++iteration)
  {
    getline(cin, s);

    if (iteration == 1)
    {
      trim();
      parse("for ");
      i = parseVar();
      parse(" in range(");
      a = parseNum();
      parseVar();
      b = parseNum();
      auto foo = parseVar();
      c = foo == "," ? parseNum() : 1;

      // cout << i << " " << a << " " << b << " " << c << '\n';
    }

    if (iteration == 2)
    {
      trim();
      parse("for ");
      j = parseVar();
      parse(" in range(");
      d = parseNum();
      parseVar();
      e = parseNum();
      auto foo = parseVar();
      f = foo == "," ? parseNum() : 1;

      // cout << j << " " << d << " " << e << " " << f << '\n';

      if (c > 0)
      {
        for (int ii = a; ii < b; ii += c)
        {
          int dd = d == INT_MAX ? ii : d;
          int ee = e == INT_MAX ? ii : e;
          int ff = f == INT_MAX ? ii : f;

          if (ff > 0 && dd < ee)
          {
            ee -= 1;
            int num = (ee - dd) / ff + 1;
            int lanum = dd + (num - 1) * ff;
            answer += (dd + lanum) * num / 2;
          }
          if (ff < 0 && dd > ee)
          {
            ee += 1;
            int num = (ee - dd) / ff + 1;
            int finum = dd + (num - 1) * ff;
            // cerr << finum << " " << num << "\n";
            answer += (finum + dd) * num / 2;
          }
        }
      }
      else
      {
        for (int ii = a; ii > b; ii += c)
        {
          int dd = d == INT_MAX ? ii : d;
          int ee = e == INT_MAX ? ii : e;
          int ff = f == INT_MAX ? ii : f;

          if (ff > 0 && dd < ee)
          {
            ee -= 1;
            int num = (ee - dd) / ff + 1;
            int lanum = dd + (num - 1) * ff;
            answer += (dd + lanum) * num / 2;
          }
          if (ff < 0 && dd > ee)
          {
            ee += 1;
            int num = (ee - dd) / ff + 1;
            int finum = dd + (num - 1) * ff;
            // cerr << finum << " " << num << "\n";
            answer += (finum + dd) * num / 2;
          }
        }
      }
    }
  }

  cout << answer << '\n';
}