#include "hexagon.h"
#include <iostream>
#include <vector>
#include <cmath>
#include<map>
#include <algorithm>
#include <iomanip>
#include <string>
#include<stack>
#include <set>
#include <queue>
#include <chrono>
#include<array>
#include<bitset>
#include<unordered_map>
#include<random>
#include<cassert>
#include<cstring>
using namespace std;
using ll = long long;
using db = double;
const float pi = 3.14159265359;
#define V vector
#define VI V<int>
#define P pair<int,int>
#define rep(i, a, b, step) for (int i = int(a); i <= int(b); i += step)
#define repl(i,a,b,step) for (int i = int(a); i >= int(b); i -= step)
#define prime(n) [](int x) { for (int i = 2; i *1ll* i <= x; ++i) if (x % i == 0) return false; return x > 1; }(n)
#define printall(container, ch) for (const auto& elem : container) { std::cout << elem << ch; } std::cout << std::endl;
#define sn << '\n'
#define ed << endl
#define sz size()
#define print cout <<
#define debug(x) cerr<< #x << " = " << x sn;
#define mpII map<int,int>
#define mine min_element
#define maxe max_element
#define all(v) begin(v), end(v)
#define txt freopen("snakes.in", "r", stdin); freopen("snakes.out", "w", stdout)
#define pb push_back
#define pq priority_queue
#define rev reverse
#define nuyn(a) a.erase(unique(all(a)), end(a))
#define nx next_permutation
#define pk pop_back()
#define START print "Start" sn
#define END print "End" sn
#define ff first
#define ss second
#define ts to_string
#define ub upper_bound
#define mk make_pair
#define lb lower_bound
#define testcase int t;cin>>t;while(t--)solution();
const int mod = 1e9 + 7;
int bp(int a, int b) {
if (!b)return 1;
int cur = bp(a, b / 2);
return cur * 1ll * cur % mod * (b & 1 ? a : 1) % mod;
}
int draw_territory(int n, int a, int b, std::vector<int> d, std::vector<int> l) {
ll ln = l[0], ans = 0, sum;
assert(l[0] == l[1] - 1 and l[2] == l[3]);
sum = ln * (ln + 1) % mod * (2 * ln + 1) % mod * 1ll * bp(6, mod - 2) % mod;
sum -= ln * (ln + 1) / 2 % mod;
if (sum < 0)sum += mod;
ans += sum * b % mod;
ans %= mod;
ans += ln * (ln + 1) / 2 % mod * a % mod;
ans %= mod;
return ans;
}
