// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e6 + 5;
const int MOD = 1e9 + 7;

int X1, X2, X3, X4, X5, X6;
int Y1, Y2, Y3, Y4, Y5, Y6;

void input()
{
    read(X1); read(X2); read(X3); read(X4); read(X5); read(X6);
    read(Y1); read(Y2); read(Y3); read(Y4); read(Y5); read(Y6);
}

LL fac[MAXN], ifac[MAXN];

LL fpm(LL base, LL exp)
{
    LL ret = 1;
    for (; exp; exp >>= 1) {
        if (exp & 1)
            (ret *= base) %= MOD;
        (base *= base) %= MOD;
    }
    return ret;
}

inline LL C(int x, int y)
{
    assert(x >= 0 && y >= 0);
    return fac[x + y] * ifac[x] % MOD * ifac[y] % MOD;
}

inline LL P(Pii s, Pii t)
{
    return C(t.x - s.x, t.y - s.y);
}

void solve()
{
    int rng = X6 + Y6;

    fac[0] = 1;
    for (int i = 1; i <= rng; ++i) {
        fac[i] = fac[i - 1] * i % MOD;
    }
    ifac[rng] = fpm(fac[rng], MOD - 2);
    for (int i = rng; i >= 1; --i) {
        ifac[i - 1] = ifac[i] * i % MOD;
    }

    LL ans = 0;

    for (auto tx : {MP(MP(X1 - 1, Y1 - 1), 1), MP(MP(X1 - 1, Y2), -1), MP(MP(X2, Y1 - 1), -1), MP(MP(X2, Y2), 1)}) {
        Pii x = tx.x;
        for (auto ty : {MP(MP(X5, Y5), 1), MP(MP(X5, Y6 + 1), -1), MP(MP(X6 + 1, Y5), -1), MP(MP(X6 + 1, Y6 + 1), 1)}) {
            Pii y = ty.x;
            LL cur = 0;
            for (int i = X3; i <= X4; ++i) {
                (cur += -(i + Y3) * P(x, MP(i, Y3 - 1)) % MOD * P(MP(i, Y3), y)) %= MOD;
                (cur += (i + Y4 + 1) * P(x, MP(i, Y4)) % MOD * P(MP(i, Y4 + 1), y)) %= MOD;
            }
            for (int i = Y3; i <= Y4; ++i) {
                (cur += -(X3 + i) * P(x, MP(X3 - 1, i)) % MOD * P(MP(X3, i), y)) %= MOD;
                (cur += (X4 + i + 1) * P(x, MP(X4, i)) % MOD * P(MP(X4 + 1, i), y)) %= MOD;
            }
            (ans += tx.y * ty.y * cur) %= MOD;
        }
    }
    (ans += MOD) %= MOD;

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();
}

// 旧时王谢堂前燕，飞入寻常百姓家。
//     -- 刘禹锡《乌衣巷》


Measured memory_bytes: 31616