#include <bits/stdc++.h>
#define ALL(v) begin(v), end(v)

using i64 = int64_t;

const int kMod = 1E9 + 7;
auto S(int n) -> int { return i64{n + 1} * n / 2 % kMod; }

int ans;
i64 a, b, c, d, e;
std::array<i64, 11> v;

auto main() -> int {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr), std::cout.tie(nullptr);

  for (int i = 1; i <= 10; ++i) std::cin >> v[i];
  a = v[2] + 2 * v[4] + 3 * v[8], b = v[6], c = v[10];
  d = v[3] + 2 * v[9], e = v[5];
  ans = (a + 1) % kMod * ((b + d + 1) % kMod) % kMod * ((c + e + 1) % kMod) %
        kMod;
  if (c - e) {
    (ans += std::min(c, e) % kMod *
            ((std::max(c, e) - std::min(c, e) - 1) % kMod) % kMod *
            ((b + d + 1) % kMod) % kMod) %= kMod;
  }
  if (b - d) {
    (ans += std::min(b, d) % kMod *
            ((std::max(b, d) - std::min(b, d) - 1) % kMod) *
            ((c + e + 1) % kMod) % kMod) %= kMod;
  }
  (ans += S(std::min(c, e) % kMod) * ((b + d + 1) % kMod) % kMod) %= kMod;
  (ans += S(std::min(b, d) % kMod) * ((c + e + 1) % kMod) % kMod) %= kMod;
  std::cout << i64{ans} * (v[7] + 1) % kMod << '\n';

  return 0;
}