// #include "hexagon.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 2 * 1e5 + 25;

int draw_territory(int n, int a, int b, vector<int> d, vector<int> l) {
    return 1LL * (l[0] + 1) * (l[0] + 2) / 2 % mod * a % mod;
}
// int main() {
//   int N, A, B;
//   assert(3 == scanf("%d %d %d", &N, &A, &B));
//   std::vector<int> D(N), L(N);
//   for (int i = 0; i < N; ++i) {
//     assert(2 == scanf("%d %d", &D[i], &L[i]));
//   }

//   int result = draw_territory(N, A, B, D, L);
//   printf("%d\n", result);
//   return 0;
// }