#pragma GCC optimize("Ofast") #include "bits/stdc++.h" // Begin Header {{{ using namespace std; #ifndef DEBUG #define dump(...) #endif #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i) #define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i) #define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i) #define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__) constexpr size_t operator""_zu(unsigned long long value) { return value; }; constexpr intmax_t operator""_jd(unsigned long long value) { return value; }; constexpr uintmax_t operator""_ju(unsigned long long value) { return value; }; constexpr int INF = 0x3f3f3f3f; constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd; template > using MaxHeap = priority_queue, Compare>; template > using MinHeap = priority_queue, Compare>; inline void input() {} template inline void input(Head&& head, Tail&&... tail) { cin >> head; input(forward(tail)...); } template ::value, nullptr_t> = nullptr> inline istream& operator>>(istream &is, Container &vs) { for (auto &v: vs) is >> v; return is; } inline void output() { cout << "\n"; } template inline void output(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail)) cout << " "; output(forward(tail)...); } template ::value, nullptr_t> = nullptr> inline ostream& operator<<(ostream &os, const Container &vs) { static constexpr const char *delim[] = {" ", ""}; for (auto it = begin(vs); it != end(vs); ++it) { os << delim[it == begin(vs)] << *it; } return os; } template inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") { for (auto it = Begin; it != End; ++it) { cout << ((it == Begin) ? "" : delim) << *it; } cout << last; } template inline vector makeVector(const T &init_value, size_t sz) { return vector(sz, init_value); } template inline auto makeVector(const T &init_value, size_t sz, Args... args) { return vector(init_value, args...))>(sz, makeVector(init_value, args...)); } template class FixPoint : Func { public: explicit constexpr FixPoint(Func&& f) noexcept : Func(forward(f)) {} template constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(*this, std::forward(args)...); } }; template static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint{forward(f)}; } template struct reverse_t { Container &c; reverse_t(Container &c) : c(c) {} auto begin() { return c.rbegin(); } auto end() { return c.rend(); } }; template auto reversed(Container &c) { return reverse_t(c); } template inline bool chmax(T &a, const T &b) noexcept { return b > a && (a = b, true); } template inline bool chmin(T &a, const T &b) noexcept { return b < a && (a = b, true); } template inline T diff(const T &a, const T &b) noexcept { return a < b ? b - a : a - b; } void operator|=(vector::reference lhs, const bool rhs) { lhs = lhs | rhs; } void ioinit() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); clog << fixed << setprecision(10); } // }}} End Header // ModInt {{{ template class ModInt { public: using value_type = intmax_t; private: static constexpr value_type cmod = Modulo; // compile-time static value_type rmod; // runtime value_type value = 0; static constexpr value_type inverse(value_type n, value_type m) { value_type a = n; value_type b = m; value_type x = 0; value_type y = 1; for (value_type u = y, v = x; a;) { const value_type t = b / a; swap(x -= t * u, u); swap(y -= t * v, v); swap(b -= t * a, a); } if ((x %= m) < 0) x += m; return x; } static value_type normalize(intmax_t n, value_type m) { if (n >= m) { n %= m; } else if (n < 0) { if ((n %= m) < 0) n += m; } return n; } public: ModInt() = default; ModInt(intmax_t n) : value(normalize(n, getModulo())) {} template constexpr explicit operator T() const { return static_cast(value); } ModInt& operator=(intmax_t n) { value = normalize(n, getModulo()); return *this; } ModInt& operator+=(const ModInt& other) { if ((value += other.value) >= getModulo()) value -= getModulo(); return *this; } ModInt& operator-=(const ModInt& other) { if ((value -= other.value) < 0) value += getModulo(); return *this; } ModInt& operator*=(const ModInt& other) { value = (value * other.value) % getModulo(); return *this; } ModInt& operator/=(const ModInt& other) { value = (value * inverse(other.value, getModulo())) % getModulo(); return *this; } ModInt& operator++() { if (++value == getModulo()) value = 0; return *this; } ModInt& operator--() { if (value-- == 0) value = getModulo() - 1; return *this; } ModInt operator++(int) { const ModInt tmp(*this); ++*this; return tmp; } ModInt operator--(int) { const ModInt tmp(*this); --*this; return tmp; } friend ModInt operator+(ModInt lhs, const ModInt& rhs) { return lhs += rhs; } friend ModInt operator-(ModInt lhs, const ModInt& rhs) { return lhs -= rhs; } friend ModInt operator*(ModInt lhs, const ModInt& rhs) { return lhs *= rhs; } friend ModInt operator/(ModInt lhs, const ModInt& rhs) { return lhs /= rhs; } ModInt operator+() const { return *this; } ModInt operator-() const { if (value == 0) return *this; return ModInt(getModulo() - value); } friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs.value == rhs.value; } friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return !(lhs == rhs); } friend ostream& operator<<(ostream& os, const ModInt& n) { return os << n.value; } friend istream& operator>>(istream& is, ModInt& n) { is >> n.value; n.value = normalize(n.value, getModulo()); return is; } static value_type getModulo() { return ((cmod > 0) ? cmod : rmod); } template ::type> static T setModulo(value_type m) { rmod = m; } }; template constexpr typename ModInt::value_type ModInt::cmod; template typename ModInt::value_type ModInt::rmod; // }}} constexpr intmax_t MOD = intmax_t(1e9) + 7; // constexpr intmax_t MOD = 998244353; using Mint = ModInt; signed main() { ioinit(); var(size_t, T); while (T--) { var(size_t, N); vector as(N); input(as); Mint res = 1; for (const auto a: as) res *= (a + 1); res--; output(res); } return 0; }