/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#pragma GCC target("sse4,tune=native")
#pragma GCC optimize("O3","unroll-loops")
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkopt(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";
const int Mod = 1000000007;
const int MAXM = 2000228;

int sum(int a, int b) {
	return (a + b >= Mod ? a + b - Mod: a + b);
}


int mul(int a, int b) {
	return (1LL * a * b) % Mod;
}


int powm(int a, int b) {
	if (b == 0) {
		return 1;
	}
	if (b & 1) {
		return mul(a, powm(a, b - 1));
	}
	int g = powm(a, b >> 1);
	return mul(g, g);
}
//14:30
//16:40
int x1, x2, x3, x4, x5, x6;
int y1, y2, y3, y4, y5, y6;
int fact[MAXM], invfact[MAXM];


int cnk(int n, int m) {
	n++;
	m++;
	return mul(mul(fact[n + m], invfact[n]), invfact[m]);
}


long long work(int x3, int y3, int x4, int y4) {
	int f = cnk(x3-x1,y3-y1) - cnk(x3-x1,y3-y2) - cnk(x3-x2,y3-y1) + cnk(x3-x2,y3-y2);
	f %= Mod;
	if (f < 0) {
		f += Mod;
	}
	int f1 = cnk(x6-x4,y6-y4) - cnk(x5-x4,y6-y4) - cnk(x6-x4,y5-y4) + cnk(x5-x4,y5-y4);
	f1 %= Mod;
	if (f1 < 0) {
		f1 += Mod;
	}
	return mul(f, f1);
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> x1 >> x2 >> x3 >> x4 >> x5 >> x6;
	cin >> y1 >> y2 >> y3 >> y4 >> y5 >> y6;
	x2++;
	y2++;
	x5--;
	y5--;
	fact[0] = 1;
	for (int i = 1; i < MAXM; i++) {
		fact[i] = mul(fact[i - 1], i);
	}
	invfact[MAXM - 1] = powm(fact[MAXM - 1], Mod - 2);
	for (int i = MAXM - 2; i >= 0; i--) {
		invfact[i] = mul(invfact[i + 1], i + 1);
	}
	int ans = 0;
	for (int i = x3; i <= x4; i++) {
		ans = sum(ans, sum(mul(work(i, y4, i, y4 + 1), y4 + i + 1), Mod - mul(work(i, y3 - 1, i, y3), y3 + i)));
	}
	for (int i = y3; i <= y4; i++) {
		ans = sum(ans, sum(mul(work(x4, i, x4 + 1, i), x4 + i + 1), Mod - mul(work(x3 - 1, i, x3, i), x3 + i)));
	}
	cout << ans << '\n';
	return 0; 		
}


Measured memory_bytes: 15872