#ifdef stderr_path #define LOCAL #define _GLIBCXX_DEBUG #endif #pragma GCC optimize("Ofast") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // #define NDEBUG #define debug_stream std::cerr #define iostream_untie true #define __precision__ 10 #define rep(i, n) for(int i = 0; i < int(n); ++i) #define all(v) std::begin(v), std::end(v) #define rall(v) std::rbegin(v), std::rend(v) #define __odd(n) ((n)&1) #define __even(n) (__odd(n) ^ 1) #define __popcount(n) __builtin_popcountll(n) #define __clz32(n) __builtin_clz(int32_t(n)) #define __clz64(n) __builtin_clzll(int64_t(n)) #define __ctz32(n) __builtin_ctz(int32_t(n)) #define __ctz64(n) __builtin_ctzll(int64_t(n)) using i64 = int_fast64_t; using pii = std::pair; using pll = std::pair; template using heap = std::priority_queue; template using minheap = std::priority_queue, std::greater>; template constexpr T inf = std::numeric_limits::max() / T(2) - T(1123456); namespace execution { std::chrono::system_clock::time_point start_time, end_time; void print_elapsed_time() { end_time = std::chrono::system_clock::now(); std::cerr << "\n----- Exec time : "; std::cerr << std::chrono::duration_cast( end_time - start_time) .count(); std::cerr << " ms -----\n\n"; } struct setupper { setupper() { if(iostream_untie) { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); } std::cout << std::fixed << std::setprecision(__precision__); #ifdef stderr_path if(freopen(stderr_path, "a", stderr)) { std::cerr << std::fixed << std::setprecision(__precision__); } else fclose(stderr); #endif #ifdef stdout_path if(not freopen(stdout_path, "w", stdout)) { freopen("CON", "w", stdout); std::cerr << "Failed to open the stdout file\n\n"; } std::cout << ""; #endif #ifdef stdin_path if(not freopen(stdin_path, "r", stdin)) { freopen("CON", "r", stdin); std::cerr << "Failed to open the stdin file\n\n"; } #endif #ifdef LOCAL atexit(print_elapsed_time); start_time = std::chrono::system_clock::now(); #endif } } __setupper; } // namespace execution class myclock_t { std::chrono::system_clock::time_point built_pt, last_pt; int built_ln, last_ln; std::string built_func, last_func; bool is_built; public: explicit myclock_t() : is_built(false) {} void build(int crt_ln, const std::string &crt_func) { is_built = true; last_pt = built_pt = std::chrono::system_clock::now(); last_ln = built_ln = crt_ln, last_func = built_func = crt_func; } void set(int crt_ln, const std::string &crt_func) { if(is_built) { last_pt = std::chrono::system_clock::now(); last_ln = crt_ln, last_func = crt_func; } else { debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::set failed (yet to be built!)\n"; } } void get(int crt_ln, const std::string &crt_func) { if(is_built) { std::chrono::system_clock::time_point crt_pt( std::chrono::system_clock::now()); int64_t diff = std::chrono::duration_cast(crt_pt - last_pt) .count(); debug_stream << diff << " ms elapsed from" << " [ " << last_ln << " : " << last_func << " ]"; if(last_ln == built_ln) debug_stream << " (when built)"; debug_stream << " to" << " [ " << crt_ln << " : " << crt_func << " ]" << "\n"; last_pt = built_pt, last_ln = built_ln, last_func = built_func; } else { debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::get failed (yet to be built!)\n"; } } }; #ifdef LOCAL myclock_t __myclock; #define build_clock() __myclock.build(__LINE__, __func__) #define set_clock() __myclock.set(__LINE__, __func__) #define get_clock() __myclock.get(__LINE__, __func__) #else #define build_clock() ((void)0) #define set_clock() ((void)0) #define get_clock() ((void)0) #endif namespace std { template void rsort(RAitr __first, RAitr __last) { sort(__first, __last, greater<>()); } template size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); } template struct hash> { size_t operator()(pair const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } }; template ::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine( tuple_hash_calc::apply(seed, t), get(t)); } }; template struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } }; template struct hash> { size_t operator()(tuple const &t) const { return tuple_hash_calc>::apply(0, t); } }; template istream &operator>>(std::istream &s, pair &p) { return s >> p.first >> p.second; } template ostream &operator<<(std::ostream &s, const pair p) { return s << p.first << " " << p.second; } template istream &operator>>(istream &s, vector &v) { for(T &e : v) { s >> e; } return s; } template ostream &operator<<(ostream &s, const vector &v) { bool is_front = true; for(const T &e : v) { if(not is_front) { s << ' '; } else { is_front = false; } s << e; } return s; } template struct tupleos { static ostream &apply(ostream &s, const tuple_t &t) { tupleos::apply(s, t); return s << " " << get(t); } }; template struct tupleos { static ostream &apply(ostream &s, const tuple_t &t) { return s << get<0>(t); } }; template ostream &operator<<(ostream &s, const tuple &t) { return tupleos, tuple_size>::value - 1>::apply( s, t); } template <> ostream &operator<<(ostream &s, const tuple<> &t) { return s; } string revstr(string str) { reverse(str.begin(), str.end()); return str; } } // namespace std #ifdef LOCAL #define dump(...) \ debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n", \ dump_func(#__VA_ARGS__, __VA_ARGS__) template void dump_func(const char *ptr, const T &x) { debug_stream << '\t'; for(char c = *ptr; c != '\0'; c = *++ptr) { if(c != ' ') debug_stream << c; } debug_stream << " : " << x << '\n'; } template void dump_func(const char *ptr, const T &x, rest_t... rest) { debug_stream << '\t'; for(char c = *ptr; c != ','; c = *++ptr) { if(c != ' ') debug_stream << c; } debug_stream << " : " << x << ",\n"; dump_func(++ptr, rest...); } #else #define dump(...) ((void)0) #endif template void write(const T &x) { std::cout << x << '\n'; } template void write(const T &x, rest_t... rest) { std::cout << x << ' '; write(rest...); } void writeln() {} template void writeln(const T &x, rest_t... rest) { std::cout << x << '\n'; writeln(rest...); } #define esc(...) writeln(__VA_ARGS__), exit(0) template void read_range(P __first, P __second) { for(P i = __first; i != __second; ++i) std::cin >> *i; } template void write_range(P __first, P __second) { for(P i = __first; i != __second; std::cout << (++i == __second ? '\n' : ' ')) { std::cout << *i; } } // substitute a variable. template void subst(T &x, const T &y) { x = y; } template bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; } template bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; } template constexpr T minf(const T &x, const T &y) { return std::min(x, y); } template constexpr T maxf(const T &x, const T &y) { return std::max(x, y); } // binary search. template int_t bin(int_t ok, int_t ng, const F &f) { while(std::abs(ok - ng) > 1) { int_t mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; } template void init(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); } template void reset(A (&array)[N]) { memset(array, 0, sizeof(array)); } // a integer uniformly and randomly chosen from the interval [l, r). template int_t rand_int(int_t l, int_t r) { static std::random_device seed_gen; static std::mt19937 engine(seed_gen()); std::uniform_int_distribution unid(l, r - 1); return unid(engine); } // a real number uniformly and randomly chosen from the interval [l, r). template real_t rand_real(real_t l, real_t r) { static std::random_device seed_gen; static std::mt19937 engine(seed_gen()); std::uniform_real_distribution unid(l, r); return unid(engine); } namespace math { template constexpr int_t gcd(int_t x, int_t y) { x = x > 0 ? x : -x, y = y > 0 ? y : -y; while(y) y ^= x ^= y ^= x %= y; return x; } template constexpr int_t lcm(int_t x, int_t y) { return x ? x / gcd(x, y) * y : 0; } // a tuple (g, x, y) s.t. g = gcd(a, b) && ax + by = g. template constexpr std::tuple ext_gcd(int_t a, int_t b) { int_t sgn_a = a >= 0 ? 1 : (a = -a, 0), sgn_b = b >= 0 ? 1 : (b = -b, 0); int_t p = 1, q = 0, r = 0, s = 1; while(b) { int_t t = a / b; r ^= p ^= r ^= p -= t * r; s ^= q ^= s ^= q -= t * s; b ^= a ^= b ^= a %= b; } return std::tuple(a, sgn_a ? p : -p, sgn_b ? q : -q); } // a pair (x, y) s.t. "x mod y" is true iff "k mod m" && "l mod n" if exist, otherwise (-1, -1). template constexpr std::pair mod_comp(int_t k, int_t m, int_t l, int_t n) { assert(m > 0 and n > 0); int_t g, x, y; std::tie(g, x, y) = ext_gcd(m, n); k += ((k %= m) < 0) * m, l += ((l %= n) < 0) * n; int_t s = k / g, t = l / g, r = k % g; if(r != l % g) return std::pair(-1, -1); int_t lcm = m / g * n; return std::pair( (m * x % lcm * t % lcm + n * y % lcm * s % lcm + r + lcm * 2) % lcm, lcm); } } // namespace math /* The main code follows. */ using namespace std; using namespace math; signed main() { void __solve(); void __precalc(); unsigned int t = 1; // cin >> t; __precalc(); while(t--) { __solve(); } } void __precalc() {} namespace math { template struct modint { int x; constexpr modint() : x(0) {} constexpr modint(int_fast64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} constexpr modint &operator+=(const modint &p) { if((x += p.x) >= mod) x -= mod; return *this; } constexpr modint &operator++() { return ++x, *this; } constexpr modint operator++(int) { modint t = *this; return ++x, t; } constexpr modint &operator-=(const modint &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } constexpr modint &operator--() { return --x, *this; } constexpr modint operator--(int) { modint t = *this; return --x, t; } constexpr modint &operator*=(const modint &p) { return x = (int_fast64_t)x * p.x % mod, *this; } constexpr modint &operator/=(const modint &p) { return *this *= inverse(p); } // constexpr modint &operator%=(int m) { return x %= m, *this; } constexpr modint operator-() const { return modint(-x); } constexpr modint operator+(const modint &p) const { return modint(*this) += p; } constexpr modint operator-(const modint &p) const { return modint(*this) -= p; } constexpr modint operator*(const modint &p) const { return modint(*this) *= p; } constexpr modint operator/(const modint &p) const { return modint(*this) /= p; } // constexpr modint operator%(int m) const { return modint(*this) %= m; // } constexpr bool operator==(const modint &p) const { return x == p.x; } constexpr bool operator!=(const modint &p) const { return x != p.x; } constexpr bool operator!() const { return !x; } // constexpr bool operator>(const modint &p) const { return x > p.x; } // constexpr bool operator<(const modint &p) const { return x < p.x; } // constexpr bool operator>=(const modint &p) const { return x >= p.x; } // constexpr bool operator<=(const modint &p) const { return x <= p.x; } constexpr friend modint inverse(const modint &p) { int a = p.x, b = mod, u = 1, v = 0; while(b > 0) { int t = a / b; a -= t * b; a ^= b ^= a ^= b; u -= t * v; u ^= v ^= u ^= v; } return modint(u); } constexpr friend modint pow(modint p, int_fast64_t e) { if(e < 0) e = (e % (mod - 1) + mod - 1) % (mod - 1); modint ret = 1; while(e) { if(e & 1) ret *= p; p *= p; e >>= 1; } return ret; } friend std::ostream &operator<<(std::ostream &s, const modint &p) { return s << p.x; } friend std::istream &operator>>(std::istream &s, modint &p) { int_fast64_t x; p = modint((s >> x, x)); return s; } }; } // namespace math void __solve() { vector a({1,2,3}); std::cerr << a << "\n"; using mint=modint<1000000007>; mint ans=0; int h, w; cin >> h >> w; vector> p(w); static bool isp[3123456]; init(isp,true); isp[0]=isp[1]=0; for(int i=2;i>j&1) { sgn=-sgn; pp*=p[i][j]; } } mint c=(h-1)/pp; mint tmp=c*(mint(h)*2-(c+1)*pp); now+=tmp*sgn; } if(i==1) now+=h; ans+=now*(w-i); } std::cout << ans << "\n"; }