#1199062 (C++23) No.3799 1 + 6 = 7 (Another version)

提出ソース
結果

問題	No.3799 1 + 6 = 7 (Another version)
ユーザー	miscalc
提出日時	2026-11-14 00:12:57
言語	C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) コンパイル: `g++-15 -O2 -fplugin=/usr/lib/yukicoder/noavx512-gcc15.so -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_` 実行: `./a.out`
結果	WA
実行時間	-
コード長	45,613 bytes
記録記録タグの例: 初AC ショートコード純ショートコード純主流ショートコード最速実行時間
コンパイル時間	3,443 ms
コンパイル使用メモリ	362,276 KB
実行使用メモリ	6,400 KB
最終ジャッジ日時	2026-11-14 00:13:03
合計ジャッジ時間	5,433 ms
ジャッジサーバーID （参考情報）	judge4_0 / judge3_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 3
other	AC * 6 WA * 30
権限があれば一括ダウンロードができます
ソースコード

raw source code
// https://github.com/miscalculation53/library
#define SINGLE_TESTCASE 
// #define MULTI_TESTCASE
// #define AOJ_TESTCASE

#define FAST_IO 
// #define FAST_CIO
// #define INTERACTIVE

#define INF 4'000'000'000'000'000'037LL
#define EPS 1e-11
#include <bits/stdc++.h>
using namespace std;

#if __cplusplus > 202002L && defined(__STDCPP_FLOAT128_T__)
#include <stdfloat>
using f128 = std::float128_t;
#elif defined(__SIZEOF_FLOAT128__)
using f128 = __float128;
#else
#error "f128 requires a compiler with IEEE binary128 support, such as GCC on x86_64."
#endif
#define LIBRARY_HAS_FLOAT128 1

#include <cassert>
using namespace std;

using ld = decltype(EPS);

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using tllll = tuple<ll, ll, ll, ll>;

#define vc vector
template <class T>
using vvc = vc<vc<T>>;
template <class T>
using vvvc = vc<vc<vc<T>>>;

using vb = vc<bool>;
using vl = vc<ll>;
using vpll = vc<pll>;
using vtlll = vc<tlll>;
using vtllll = vc<tllll>;
using vstr = vc<string>;
using vvb = vvc<bool>;
using vvl = vvc<ll>;

template <class T>
using pql = priority_queue<T, vc<T>, greater<T>>;
template <class T>
using pqg = priority_queue<T>;

using i128 = __int128_t;
using u128 = __uint128_t;

#define cauto const auto
//! https://gcc.gnu.org/onlinedocs/libquadmath/Math-Library-Routines.html
i128 stoi128(const string &s)
{
  const bool neg = s.front() == '-';
  u128 res = 0;
  for (size_t i = size_t(neg); i < s.size(); i++)
    res = 10 * res + unsigned(s[i] - '0');
  if (neg)
    return -i128(res - 1) - 1;
  return i128(res);
}
inline string u128tos(u128 x)
{
  string res;
  do
  {
    res += char('0' + x % 10);
    x /= 10;
  } while (x > 0);
  reverse(res.begin(), res.end());
  return res;
}
string i128tos(i128 x)
{
  return x < 0 ? "-" + u128tos(u128(-(x + 1)) + 1) : u128tos(u128(x));
}
istream &operator>>(istream &is, i128 &a)
{
  string s;
  if (!(is >> s)) return is;
  a = stoi128(s);
  return is;
}
ostream &operator<<(ostream &os, const i128 &a)
{
  os << i128tos(a);
  return os;
}
#define overload4(_1,_2,_3,_4,name,...) name
#define LIBRARY_REPEAT_LOOP(T,i,l,r,d) for (auto [i, library_repeat_end, library_repeat_step] = array<T, 3>{T(l), T(r), T(d)}; library_repeat_step > 0 ? i < library_repeat_end : i > library_repeat_end; i += library_repeat_step)

#define rep1(i,n) LIBRARY_REPEAT_LOOP(ll, i, 0, n, 1)
#define rep2(i,l,r) LIBRARY_REPEAT_LOOP(ll, i, l, r, 1)
#define rep3(i,l,r,d) LIBRARY_REPEAT_LOOP(ll, i, l, r, d)
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define repi1(i,n) LIBRARY_REPEAT_LOOP(int, i, 0, n, 1)
#define repi2(i,l,r) LIBRARY_REPEAT_LOOP(int, i, l, r, 1)
#define repi3(i,l,r,d) LIBRARY_REPEAT_LOOP(int, i, l, r, d)
#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)

#define fe(...) for (auto __VA_ARGS__)
#define fec(...) for (cauto &__VA_ARGS__)
#define fem(...) for (auto &__VA_ARGS__)
template <class T, class U, class P>
constexpr pair<T, U> &operator+=(pair<T, U> &a, const P &b)
{
  a.first += b.first;
  a.second += b.second;
  return a;
}
template <class T, class U, class P>
constexpr pair<T, U> operator+(pair<T, U> a, const P &b) { return a += b; }
template <class T, class U, class P>
constexpr pair<T, U> &operator-=(pair<T, U> &a, const P &b)
{
  a.first -= b.first;
  a.second -= b.second;
  return a;
}
template <class T, class U, class P>
constexpr pair<T, U> operator-(pair<T, U> a, const P &b) { return a -= b; }
template <class T, class U>
constexpr pair<T, U> operator-(pair<T, U> a)
{
  a.first = -a.first;
  a.second = -a.second;
  return a;
}

template <class T, size_t n, class A>
constexpr array<T, n> &operator+=(array<T, n> &a, const A &b)
{
  for (size_t i = 0; i < n; i++)
    a[i] += b[i];
  return a;
}
template <class T, size_t n, class A>
constexpr array<T, n> operator+(array<T, n> a, const A &b) { return a += b; }
template <class T, size_t n, class A>
constexpr array<T, n> &operator-=(array<T, n> &a, const A &b)
{
  for (size_t i = 0; i < n; i++)
    a[i] -= b[i];
  return a;
}
template <class T, size_t n, class A>
constexpr array<T, n> operator-(array<T, n> a, const A &b) { return a -= b; }
template <class T, size_t n>
constexpr array<T, n> operator-(array<T, n> a)
{
  for (auto &ai : a)
    ai = -ai;
  return a;
}

namespace internal
{

template <size_t... I, class A, class B>
constexpr auto &tuple_add_impl(A &a, const B &b, const index_sequence<I...>)
;

template <size_t... I, class A, class B>
constexpr auto &tuple_sub_impl(A &a, const B &b, const index_sequence<I...>)
;

template <size_t... I, class A>
constexpr auto &tuple_neg_impl(A &a, const index_sequence<I...>)
;

};

template <class... Ts, class Tp>
constexpr tuple<Ts...> &operator+=(tuple<Ts...> &a, const Tp &b)
{ return internal::tuple_add_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }
template <class... Ts, class Tp>
constexpr tuple<Ts...> operator+(tuple<Ts...> a, const Tp &b) { return a += b; }
template <class... Ts, class Tp>
constexpr tuple<Ts...> &operator-=(tuple<Ts...> &a, const Tp &b)
{ return internal::tuple_sub_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }
template <class... Ts, class Tp>
constexpr tuple<Ts...> operator-(tuple<Ts...> a, const Tp &b) { return a -= b; }
template <class... Ts>
constexpr tuple<Ts...> operator-(tuple<Ts...> a)
{
  internal::tuple_neg_impl(a, make_index_sequence<sizeof...(Ts)>{});
  return a;
}
template <class T>
constexpr bool is_integral_ext = is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>;

template <class T>
constexpr bool is_signed_ext = is_signed_v<T> || is_same_v<T, i128>;

template <class T>
constexpr bool is_unsigned_ext = is_unsigned_v<T> || is_same_v<T, u128>;
template <class T>
struct make_unsigned_ext
{
  using type = make_unsigned_t<T>;
};
template <>
struct make_unsigned_ext<i128>
{
  using type = u128;
};
template <>
struct make_unsigned_ext<u128>
{
  using type = u128;
};
template <class T>
using make_unsigned_ext_t = typename make_unsigned_ext<T>::type;

template <class T>
struct make_signed_ext
{
  using type = make_signed_t<T>;
};
template <>
struct make_signed_ext<u128>
{
  using type = i128;
};
template <class T>
using make_signed_ext_t = typename make_signed_ext<T>::type;

template <class T>
constexpr bool is_negative(T x)
{
  static_assert(is_integral_ext<T>);
  if constexpr (is_signed_ext<T>) return x < 0;
  return false;
}

template <class T, bool = is_integral_ext<T>>
struct unsigned_arithmetic { using type = T; };

template <class T>
struct unsigned_arithmetic<T, true>
{
  static_assert(!is_same_v<T, bool>);
  using type = common_type_t<unsigned int, make_unsigned_ext_t<T>>;
};

template <class T>
using unsigned_arithmetic_t = typename unsigned_arithmetic<T>::type;
template <class T>
constexpr decltype(auto) default_infty();

namespace default_infty_detail
{
  template <class T>
  struct is_product : false_type {};
  template <class T, class U>
  struct is_product<pair<T, U>> : true_type {};
  template <class... Ts>
  struct is_product<tuple<Ts...>> : true_type {};
  template <class T, size_t n>
  struct is_product<array<T, n>> : true_type {};

  template <class T, class = void>
  struct has_infty : false_type {};

  template <class T>
  struct has_infty<T, void_t<decltype(T::infty())>> : true_type {};

  template <class T>
  inline constexpr bool unsupported = false;
}

template <class T>
constexpr decltype(auto) default_infty()
;
template <class T, enable_if_t<is_same_v<T, i128> || is_same_v<T, u128>, int> = 0>
inline constexpr T abs(T x) ;

namespace template_math_detail
{
template <class T, class U>
constexpr common_type_t<T, U> gcd(T a, U b)
;
template <class T, class U>
constexpr common_type_t<T, U> lcm(T a, U b)
;

}

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<i128, T> gcd(i128 a, T b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, i128> gcd(T a, i128 b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<u128, T> gcd(u128 a, T b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, u128> gcd(T a, u128 b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<i128, T> lcm(i128 a, T b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, i128> lcm(T a, i128 b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<u128, T> lcm(u128 a, T b) ;

template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, u128> lcm(T a, u128 b) ;

template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T safemod(U a, V b)
{
  const T x = T(a), y = T(b);
  if constexpr (is_signed_ext<T>)
    if (y == T(-1)) return T(0);
  const T r = x % y;
  return r != T(0) && is_negative(x) != is_negative(y) ? T(r + y) : r;
}

template <class T = ll, class U, class V>
constexpr T ipow(U a, V b)
;
template <class T = ll, class A, class B, class M>
T mul_limited(A a, B b, M m)
;

template <class T = ll, class A, class B>
T mul_limited(A a, B b) ;
template <class T = ll, class A, class B, class M>
T pow_limited(A a, B b, M m)
;
template <class T = ll, class A, class B>
T pow_limited(A a, B b) ;

template <class T = ll, class A, class K>
constexpr T iroot(A a, K k)
;
//! https://misawa.github.io/others/avoid_errors/techniques_to_avoid_errors.html

template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base)
;
template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base, int n)
;
template <const bool use_upper = true, class U>
string base_repr_str(U val, int base)
;

template <const bool use_upper = true, class U>
string base_repr_str(U val, int base, int n)
;
#define ALL(a) (a).begin(), (a).end()
template <class T = ll, class V>
inline T SZ(const V &x) { return x.size(); }
#define eb emplace_back

#define LMD(x,fx) ([&](const auto &x) { return fx; })
template <class F>
auto gen_vec(int n, const F &f)
;

#define GEN_VEC(n,i,fi) (gen_vec(n, LMD(i, fi)))

namespace template_vector_detail
{
template <class T, size_t depth>
struct nested_vector
{
  using type = vc<typename nested_vector<T, depth - 1>::type>;
};
template <class T>
struct nested_vector<T, 0>
{
  using type = T;
};
}
template <class V, class T>
void fill(V &v, const T &value)
;

template <class T = ll>
optional<T> ctol(const char &c, const string &s)
;
template <class T>
string vtos(const vc<T> &v, char first)
;

template <class T>
string vtos(const vc<T> &v, const string &t)
;

template <class T>
vc<T> concat(const vvc<T> &vs)
;

template <class T>
vc<T> concat(const vc<T> &v) ;
template <class T, class... Ts>
vc<T> concat(vc<T> v, const vc<Ts> &...vs)
;
namespace internal
{
  template <class M, class I, class = void>
  struct HasMonoidPow : false_type {};
  template <class M, class I>
  struct HasMonoidPow<M, I, void_t<decltype(M::pow(declval<const typename M::S &>(), declval<I>()))>> : true_type {};
}

namespace internal_monoid_power
{
  template <class I>
  constexpr void check_exponent(I k)
  ;
  template <class M, class I>
  constexpr typename M::S binary(typename M::S x, I k)
  ;

}

template <class M, class I>
constexpr typename M::S pow_monoid(typename M::S x, I k)
;
template <class V>
auto SUM(const V &v)
;

template <class T, class V>
T SUM(const V &v)
;
template<class T = ll, class V>
T mex(const V &a)
;

template <class I>
bool is_permutation(const vc<I> &p)
;
template <class T = ll>
vc<T> permid(const int &n, const int &base_index = 0)
;

template <class T>
vc<T> perminv(const vc<T> &p)
;

template <class T, class U>
vc<T> permuted(const vc<T> &a, const vc<U> &p)
;

template <class T, class U, class... Ts>
vc<T> permuted(const vc<T> &p, const vc<U> &q, const vc<Ts> &...rs)
;
template <class V, class Equal = equal_to<>>
void unique(V &v, Equal equal = {}) { v.erase(std::unique(ALL(v), equal), v.end()); }
template <class V, class U>
void rotate(V &v, U k)
;

template <class T>
vvc<T> top(const vvc<T> &a)
{
  if (a.empty())
    return {};
  const int n = a.size(), m = a[0].size();
  vvc<T> b(m, vc<T>(n));
  repi(i, n)
  {
    assert(SZ<int>(a[i]) == m);
    repi(j, m) b[j][i] = a[i][j];
  }
  return b;
}
vstr top(const vstr &a)
{
  vvc<char> a_(a.size());
  repi(i, SZ<int>(a)) a_[i] = {ALL(a[i])};
  vvc<char> b_ = top(a_);
  vstr b(b_.size());
  repi(i, SZ<int>(b)) b[i] = {ALL(b_[i])};
  return b;
}

template <class T, class = void>
struct has_e0 : false_type {};
template <class T>
struct has_e0<T, void_t<decltype(T::e0())>> : true_type {};
template <class T>
inline constexpr bool has_e0_v = has_e0<T>::value;

template <class T>
struct MonoidAdd
{
  using S = T;
  static constexpr S op(S a, S b) ;
  static constexpr S e()
  ;

  template <class I, class = decltype(declval<S>() * declval<I>())>
  static constexpr S pow(const S &a, I k) { return a * k; }
};
template <class T, auto infty = nullptr>
struct MonoidMin
{
  using S = T;
  static constexpr S op(S a, S b) ;
  static constexpr decltype(auto) e() ;
  template <class I>
  static constexpr S pow(const S &a, I k) { return k == 0 ? e() : a; }
};
template <class T, auto infty = nullptr>
struct MonoidMax
{
  using S = T;
  static constexpr S op(S a, S b) ;
  static constexpr S e() ;
  template <class I>
  static constexpr S pow(const S &a, I k) { return k == 0 ? e() : a; }
};

template <class M>
vc<typename M::S> cuml(const vc<typename M::S> &v, int left_index = 0)
;
template <class T>
vc<T> adjd(const vc<T> &v, int left_index = 0, int right_index = 0)
;
constexpr array<pll, 4> DRULgrid = {{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}};
constexpr array<pll, 4> DRULplane = {{{0, -1}, {1, 0}, {0, 1}, {-1, 0}}};

template <class T>
struct is_random_access_iterator
{
  static constexpr bool value = is_same_v<
    typename iterator_traits<T>::iterator_category,
    random_access_iterator_tag
  >;
};
template <class T>
constexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;
#define DEFAULT_COMP ranges::less
namespace internal
{

};

template <class T = ll, class Judge, class InitOk, class InitNg>
pair<T, T> binsearch(const Judge &judge, InitOk init_ok, InitNg init_ng, bool check_ok = true, bool check_ng = true)
;
template <class T = ld, class Judge, class InitOk, class InitNg>
T binsearch_real(const Judge &judge, InitOk init_ok, InitNg init_ng, int iteration_count = 100, bool check_ok = true, bool check_ng = true)
;
template <class T = ll, class Judge, class InitVal>
pair<T, T> expsearch(const Judge &judge, InitVal init_val, bool positive = true)
;
template <class T>
inline constexpr ull MASK(T k) { return (1ULL << k) - 1ULL; }
inline constexpr ll bit_width(ll x) { return std::bit_width((ull)x); }

inline constexpr ll bit_floor(ll x) { return std::bit_floor((ull)x); }

inline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }
inline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }
inline constexpr ll popcount(ll x) { return std::popcount((ull)x); }
inline constexpr bool has_single_bit(ll x) { return std::has_single_bit((ull)x); }

inline constexpr ull lsb_pos(ull x) { assert(x != 0); return countr_zero(x); }
inline constexpr ull msb_pos(ull x) { assert(x != 0); return bit_width(x) - 1; }
inline constexpr ull lsb_mask(ull x) { assert(x != 0); return x & -x; }
inline constexpr ull msb_mask(ull x) { assert(x != 0); return bit_floor(x); }
#define CPP_DUMP_DEFINE_DATA(...) 
#define dump(...) ((void)0)
#define local(...) 
#define oj(...) __VA_ARGS__
#define local_oj(a,b) (b)

template <class T, class Sequence>
vc<T> content(queue<T, Sequence> que)
{
  vc<T> res;
  while (!que.empty())
  {
    res.eb(que.front());
    que.pop();
  }
  return res;
}
template <class T, class Sequence, class Compare>
vc<T> content(priority_queue<T, Sequence, Compare> pque)
{
  vc<T> res;
  while (!pque.empty())
  {
    res.eb(pque.top());
    pque.pop();
  }
  return res;
}
template <class T>
auto content(const T &obj) { return obj.content(); }
namespace fastio
{
  constexpr uint32_t SIZ = 1 << 17;
  inline char ibuf[SIZ + 1], obuf[SIZ];
  inline uint32_t pil = 0, pir = 0, por = 0;

  __attribute__((noinline)) inline void load()
  {
    const uint32_t remaining = pir - pil;
    if (remaining && pil) memmove(ibuf, ibuf + pil, remaining);
    pil = 0;
    pir = remaining + uint32_t(fread(ibuf + remaining, 1, SIZ - remaining, stdin));
    ibuf[pir] = '\x7f';
  }

  inline bool ascii_space(unsigned char c)
  {
    return c == ' ' || unsigned(c - '\t') < 5;
  }
  __attribute__((noinline)) inline void flush()
  {
    size_t written = 0;
    while (written < por)
    {
      const size_t n = fwrite(obuf + written, 1, por - written, stdout);
      if (!n) abort();
      written += n;
    }
    por = 0;
  }
  inline void append_char(char c)
  {
    if (por == SIZ) flush();
    obuf[por++] = c;
  }

  template <class T>
  using integer_magnitude = conditional_t<(sizeof(T) > sizeof(ull)), u128,
                            conditional_t<(sizeof(T) > sizeof(uint)), ull, uint>>;

  inline constexpr uint powers_of_ten[8] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000};

  template <class U>
  __attribute__((always_inline)) inline void read_wide_integer_tail(
      U &value, const char *&p, uint64_t columns, uint64_t stop)
  ;
  template <class T>
  __attribute__((always_inline)) inline void rd1_integer(T &x)
  {
    using U = integer_magnitude<T>;
    const char *p = ibuf + pil;
    for (;;)
    {
      while (ascii_space(*p)) ++p;
      if (p != ibuf + pir) break;
      pil = pir;
      load();
      if (!pir) abort();
      p = ibuf;
    }
    bool negative = false;
    if (*p == '+') ++p;
    else if constexpr (numeric_limits<T>::is_signed)
    {
      if (*p == '-') negative = true, ++p;
    }
    U value = 0;
    for (;;)
    {
      while (size_t(ibuf + pir - p) >= 8)
      {
        uint64_t columns;
        memcpy(&columns, p, 8);

        const uint64_t stop = ((columns + 0x4646464646464646ULL) |
                               (columns - 0x3030303030303030ULL)) & 0x8080808080808080ULL;
        if (stop)
        {
          if constexpr (sizeof(U) > sizeof(ull))
          {
            read_wide_integer_tail(value, p, columns, stop);
            goto integer_complete;
          }
          else
          {
            if (stop & 0x80808080ULL)
            {
              if (!(stop & 0x808080ULL))
              {
                value = value * 1000 + uint(columns & 15) * 100
                      + uint(columns >> 8 & 15) * 10 + uint(columns >> 16 & 15);
                p += 3;
              }
              else if (!(stop & 0x8080ULL))
              {
                value = value * 100 + uint(columns & 15) * 10 + uint(columns >> 8 & 15);
                p += 2;
              }
              else if (!(stop & 0x80ULL))
              {
                value = value * 10 + uint(columns & 15);
                ++p;
              }
              goto integer_complete;
            }
            break;

          }
        }
        columns &= 0x0f0f0f0f0f0f0f0fULL;
        const uint64_t pairs = (columns & 0x00ff00ff00ff00ffULL) * 10
                             + ((columns >> 8) & 0x00ff00ff00ff00ffULL);
        const uint64_t quads = (pairs & 0x0000ffff0000ffffULL) * 100
                             + ((pairs >> 16) & 0x0000ffff0000ffffULL);
        value = value * 100000000 + uint(quads) * 10000 + uint(quads >> 32);
        p += 8;
      }
      while (unsigned(*p - '0') < 10)
      {
        value = value * 10 + unsigned(*p - '0');
        ++p;
      }
      pil = uint32_t(p - ibuf);
      if (pil != pir) break;
      load();
      p = ibuf;
      if (!pir) break;
    }
integer_complete:
    pil = uint32_t(p - ibuf);
    if constexpr (numeric_limits<T>::is_signed)
    {
      if (negative && value) x = T(-T(value - 1) - 1);
      else x = T(value);
    }
    else x = T(value);
  }

  template <class T, enable_if_t<numeric_limits<T>::is_integer, int> = 0>
  __attribute__((always_inline)) inline void rd1(T &x) { rd1_integer(x); }
  inline void rd1(char &x)
  ;

  inline void rd1(string &x)
  ;
  inline void rd1(float &x) ;
  inline void rd1(double &x) ;
  inline void rd1(long double &x) ;

  template <class A, class B> void rd1(pair<A, B> &x);
  template <class... T> void rd1(tuple<T...> &x);
  template <class T, size_t N> void rd1(array<T, N> &x);
  template <class T> void rd1(vc<T> &x);

  template <class A, class B>
  void rd1(pair<A, B> &x) ;
  template <class... T>
  void rd1(tuple<T...> &x)
  ;

  template <class T, size_t N>
  void rd1(array<T, N> &x)
  ;

  template <class T>
  void rd1(vc<T> &x)
  ;

  inline constexpr auto decimal_triplets = []
  {
    array<array<char, 3>, 1000> result{};
    for (unsigned i = 0; i < 1000; ++i)
    {
      result[i][0] = char('0' + i / 100);
      result[i][1] = char('0' + i / 10 % 10);
      result[i][2] = char('0' + i % 10);
    }
    return result;
  }();

  inline void store_nine(char *out, uint x)
  {
    const uint q = x / 1000, r = q / 1000;
    memcpy(out, decimal_triplets[r].data(), 3);
    memcpy(out + 3, decimal_triplets[q - r * 1000].data(), 3);
    memcpy(out + 6, decimal_triplets[x - q * 1000].data(), 3);
  }
  inline char *store_leading_triplet(char *out, uint x)
  {
    if (x >= 100)
    {
      memcpy(out, decimal_triplets[x].data(), 3);
      return out + 3;
    }
    if (x >= 10)
    {
      memcpy(out, decimal_triplets[x].data() + 1, 2);
      return out + 2;
    }
    *out = char('0' + x);
    return out + 1;
  }

  inline char *store_short(char *out, uint x)
  {
    if (x >= 1000000)
    {
      const uint q = x / 1000000;
      const uint r = x - q * 1000000;
      out = store_leading_triplet(out, q);
      memcpy(out, decimal_triplets[r / 1000].data(), 3);
      memcpy(out + 3, decimal_triplets[r % 1000].data(), 3);
      return out + 6;
    }
    if (x >= 1000)
    {
      const uint q = x / 1000;
      out = store_leading_triplet(out, q);
      memcpy(out, decimal_triplets[x - q * 1000].data(), 3);
      return out + 3;
    }
    return store_leading_triplet(out, x);
  }

  template <class U>
  inline char *store_ordinary(char *out, U x)
  {
    if constexpr (sizeof(U) > sizeof(uint))
    {
      if (x >= 1000000000000000000ULL)
      {
        const uint hi = uint(x / 1000000000000000000ULL);
        const ull tail = x - ull(hi) * 1000000000000000000ULL;
        const uint middle = uint(tail / 1000000000ULL);
        out = store_leading_triplet(out, hi);
        store_nine(out, middle);
        store_nine(out + 9, uint(tail - ull(middle) * 1000000000ULL));
        return out + 18;
      }
    }
    if (x >= 1000000000)
    {
      const uint hi = uint(x / 1000000000);
      out = store_short(out, hi);
      store_nine(out, uint(x - U(hi) * 1000000000));
      return out + 9;
    }
    return store_short(out, uint(x));
  }

  template <class U, bool newline>
  __attribute__((always_inline)) inline void write_wide_integer(U magnitude, bool negative)
  ;
  template <class T, bool newline = false>
  __attribute__((always_inline)) inline void wt1_integer(T x)
  {
    using U = integer_magnitude<T>;
    U magnitude = U(x);
    bool negative = false;
    if constexpr (numeric_limits<T>::is_signed)
    {
      negative = x < 0;
      const U sign_mask = U(0) - U(negative);
      magnitude = (magnitude ^ sign_mask) + U(negative);
    }
    if constexpr (sizeof(U) <= sizeof(ull))
    {
      if (por > SIZ - 40) flush();
      char *out = obuf + por;
      *out = '-';
      out += negative;
      out = store_ordinary(out, magnitude);
      if constexpr (newline) *out++ = '\n';
      por = uint32_t(out - obuf);
      return;
    }
    else write_wide_integer<U, newline>(magnitude, negative);
  }

  template <class T, enable_if_t<numeric_limits<T>::is_integer, int> = 0>
  __attribute__((always_inline)) inline void wt1(T x) { wt1_integer(x); }
  inline void wt1(char x) ;
  inline void wt1(const char *x) ;
  inline void wt1(string_view x) ;
  inline void wt1(const string &x) ;

  inline void wt1(float x) ;
  inline void wt1(double x) ;
  inline void wt1(long double x) ;

  template <class A, class B> void wt1(const pair<A, B> &x);
  template <class... T> void wt1(const tuple<T...> &x);
  template <class T, size_t N> void wt1(const array<T, N> &x);
  template <class T> void wt1(const vc<T> &x);

  template <class A, class B>
  void wt1(const pair<A, B> &x) ;
  template <class... T>
  void wt1(const tuple<T...> &x)
  ;

  template <class T, size_t N>
  void wt1(const array<T, N> &x)
  ;

  template <class T>
  void wt1(const vc<T> &x)
  ;

  template <class... T>
  void read(T &...x) { (rd1(x), ...); }
  template <class... T>
  void write(T &&...x) { (wt1(forward<T>(x)), ...); }
  template <class... T>
  void print(T &&...x)
  {
    if constexpr (sizeof...(T) == 1 &&
                  ((is_integral_v<decay_t<T>> && !is_same_v<decay_t<T>, char>) && ...))
      (wt1_integer<decay_t<T>, true>(forward<T>(x)), ...);
    else
    {
      size_t index = 0;
      ((index++ ? void(append_char(' ')) : void(), wt1(forward<T>(x))), ...);
      append_char('\n');
    }
  }
}

struct Dummy {
  Dummy() { atexit(fastio::flush); }
} dummy;

//! https://trap.jp/post/1224/
namespace internal
{

template <class... Ts>
void READnodump(Ts &...a) { fastio::read(a...); }

template <class... T>
void READVECnodump(int n, vc<T> &...v)
;

template <class... T>
void READVEC2nodump(int n, int m, vvc<T> &...v)
;

template <class... T>
void READJAGnodump(int n, vvc<T> &...vs)
;
};

#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)

#define LIBRARY_INOUT_TYPE(...) LIBRARY_INOUT_TYPE_IMPL(__VA_ARGS__)(__VA_ARGS__)
#define LIBRARY_INOUT_TYPE_IMPL(T,...) LIBRARY_INOUT_TYPE_SELECT(LIBRARY_INOUT_TYPE_PROBE T, LIBRARY_INOUT_TYPE_KEEP)
#define LIBRARY_INOUT_TYPE_PROBE(...) _, LIBRARY_INOUT_TYPE_REMOVE
#define LIBRARY_INOUT_TYPE_SELECT(...) LIBRARY_INOUT_TYPE_SECOND(__VA_ARGS__)
#define LIBRARY_INOUT_TYPE_SECOND(_0,_1,...) _1
#define LIBRARY_INOUT_TYPE_KEEP(...) __VA_ARGS__
#define LIBRARY_INOUT_TYPE_REMOVE(T) LIBRARY_INOUT_TYPE_KEEP T

#define IN(T,...) LIBRARY_INOUT_TYPE(T) __VA_ARGS__; READ(__VA_ARGS__)

#define CHAR(...) IN(char, __VA_ARGS__)
#define INT(...) IN(int, __VA_ARGS__)
#define LL(...) IN(ll, __VA_ARGS__)
#define STR(...) IN(string, __VA_ARGS__)
#define ARR(T,n,...) array<LIBRARY_INOUT_TYPE(T), n> __VA_ARGS__; READ(__VA_ARGS__)

#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)
#define READVEC2(...) internal::READVEC2nodump(__VA_ARGS__); dump(__VA_ARGS__)

#define VEC(T,n,...) vc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READVEC(n, __VA_ARGS__)
#define VEC2(T,n,m,...) vvc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READVEC2(n, m, __VA_ARGS__)

#define READJAG(...) internal::READJAGnodump(__VA_ARGS__); dump(__VA_ARGS__)

#define JAG(T,n,...) vvc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READJAG(n, __VA_ARGS__)

#define ENDL '\n'
#define WRITE fastio::write
#define PRINT fastio::print

#define PRINTEXIT(...) do { PRINT(__VA_ARGS__); exit(0); } while (false)
#define PRINTRETURN(...) do { PRINT(__VA_ARGS__); return; } while (false)

template <class T>
void PRINTV(const vc<T> &v) ;
#define PRINTVEXIT(...) do { PRINTV(__VA_ARGS__); exit(0); } while (false)
#define PRINTVRETURN(...) do { PRINTV(__VA_ARGS__); return; } while (false)

template <class T, class Add>
void offset(vc<T> &v, const Add &add) ;
template <class T, class Add>
void offset(vvc<T> &v, const Add &add) ;

template <class T, const size_t m>
array<vc<T>, m> unzip(const vc<array<T, m>> &vt)
;

template <class T, const size_t m>
vc<array<T, m>> zip(const array<vc<T>, m> &tv)
;
template <class T, class U>
pair<vc<T>, vc<U>> unzip(const vc<pair<T, U>> &vt)
;

template <class T, class U>
vc<pair<T, U>> zip(const pair<vc<T>, vc<U>> &tv)
;

namespace internal
{

};

template <class... Ts>
auto unzip(const vc<tuple<Ts...>> &vt)
;

template <class... Ts>
auto zip(const tuple<vc<Ts>...> &tv)
;

namespace internal
{

template <class... Ts>
auto zip_vectors(const vc<Ts> &...v)
;

};

#define UNZIP(vt,...) auto [__VA_ARGS__] = unzip(vt)
#define ZIP(vt,...) auto vt = internal::zip_vectors(__VA_ARGS__)

mt19937_64 mt;

template <class T = ll, class U1, class U2>
T randint(U1 l, U2 r)
;

template <class T = ll, class U1, class U2>
T randrange(U1 l, U2 r)
;

template <class T = double, class U1, class U2>
T randreal(U1 l, U2 r)
;

bool randbool(double p)
{
  assert(0 <= p && p <= 1);
  return bernoulli_distribution(p)(mt);
}

namespace internal
{
template <bool does_sort, class V, class T>
void random_sample_range(V &res, T l, T r)
;
};

template <int k, bool does_sort, class T = ll, class U1, class U2>
array<T, k> random_sample_range_array(U1 l, U2 r)
;

template <bool does_sort, class T = ll, class U1, class U2>
vc<T> random_sample_range_vector(U1 l, U2 r, int k)
;
/*!
 * Portions corresponding to AtCoder Library (CC0-1.0): modular arithmetic operators.
 * Upstream: atcoder/modint.hpp
 * https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
 * License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
 */
namespace larger_int_detail
{
  template <class T>
  [[deprecated("larger_int: 128-bit integer is not widened; intermediate arithmetic may overflow")]]
  constexpr bool warn_no_wider_integer()
  {
    return true;
  }
}

template <class T>
struct larger_int
{
private:
  static constexpr bool check()
  ;

  static_assert(check());

public:
  using type = T;
};

#define LARGER_INT(T,U) template <> struct larger_int<T> { using type = U; };

LARGER_INT(signed char, short)
LARGER_INT(short, int)
LARGER_INT(int, long long)
LARGER_INT(long, __int128_t)
LARGER_INT(long long, __int128_t)

LARGER_INT(unsigned char, unsigned short)
LARGER_INT(unsigned short, unsigned int)
LARGER_INT(unsigned int, unsigned long long)
LARGER_INT(unsigned long, __uint128_t)
LARGER_INT(unsigned long long, __uint128_t)

#undef LARGER_INT

template <class T>
struct Rational;

template <class T>
struct larger_int<Rational<T>>
{
  using type = Rational<typename larger_int<T>::type>;
};

template <class T>
using larger_int_t = typename larger_int<T>::type;

/*!
 * Portions corresponding to AtCoder Library (CC0-1.0): primality testing.
 * Upstream: atcoder/internal_math.hpp
 * https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
 * License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
 */

namespace internal
{

template <class T>
constexpr ll powmod_constexpr(ll x, ll n, T m)
{
  if (m == 1)
    return 0;
  using U = make_unsigned_t<T>;
  using L = larger_int_t<U>;

  U r = 1, y = safemod(x, m);
  while (n)
  {
    if (n & 1)
      r = L(r) * y % m;
    y = L(y) * y % m;
    n >>= 1;
  }
  return r;
}

template <class T>
constexpr bool isprime_constexpr(T n)
{
  if constexpr (sizeof(T) > 4)
  {
    if (n <= INT_MAX)
      return isprime_constexpr<int>(n);
  }

  if (n <= 1)
    return false;
  if (n == 2 || n == 7 || n == 61)
    return true;
  if (n % 2 == 0)
    return false;

  ll d = n - 1;
  while (d % 2 == 0)
    d /= 2;

  using U = make_unsigned_t<T>;
  using L = larger_int_t<U>;

  auto miller_rabin = [&](const auto &bases) constexpr
  {
    for (ll a : bases)
    {
      ll t = d, y = powmod_constexpr(a, t, n);
      while (t != n - 1 && y != 1 && y != n - 1)
      {
        y = L(y) * y % n;
        t <<= 1;
      }
      if (y != n - 1 && t % 2 == 0)
        return false;
    }
    return true;
  };

  if constexpr(sizeof(T) <= 4)
  {
    constexpr ll bases[3] = {2, 7, 61};
    return miller_rabin(bases);
  }
  else
  {
    constexpr ll bases[7] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    return miller_rabin(bases);
  }
}

template <auto n>
constexpr bool isprime = isprime_constexpr(n);

};

namespace internal
{

template <auto M>
struct policy_static
{
  using mod_type = decltype(M);
  using value_type = make_unsigned_t<mod_type>;
  using calc_type = conditional_t<(M <= UINT_MAX), ull, larger_int_t<value_type>>;

  static constexpr bool is_prime = isprime_constexpr(M);

  static constexpr mod_type mod() { return M; }
  static constexpr value_type umod() { return M; }

  static constexpr value_type init(value_type v) { return v; }
  static constexpr mod_type val(value_type v) { return v; }
  static constexpr value_type mul(value_type a, value_type b)
  {
    return (value_type)((calc_type(a) * b) % M);
  }
};

};

/*!
 * Portions corresponding to AtCoder Library (CC0-1.0): Barrett reduction.
 * Upstream: atcoder/internal_math.hpp
 * https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
 * License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
 */

namespace internal
{

struct barrett32
{
  uint m = 0;
  ull im = 0;
  barrett32() = default;
  explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}
  uint umod() const ;
  uint mul(uint a, uint b) const
  ;

};

template <int id>
struct policy_barrett32
{
  using value_type = uint;
  using calc_type = ull;
  using mod_type = int;

  static constexpr bool is_prime = false;
  static inline barrett32 reducer{};
  static void set_mod(mod_type m)
  ;

  static mod_type mod() ;
  static value_type umod() ;
  static value_type init(value_type v) { return v; }
  static mod_type val(value_type v) ;
  static value_type mul(value_type a, value_type b) ;
};

};

namespace internal
{

inline constexpr ull inv64(ull a)
{
  ull x = a;
  while (a * x != 1) x *= 2 - a * x;
  return x;
}

struct montgomery64odd
{
  ull m = 0, im = 0, sq = 0;
  montgomery64odd() = default;
  explicit montgomery64odd(ull m) : m(m), im(inv64(m)), sq(-u128(m) % m) {}
  ull umod() const ;
  ull reduce(u128 x) const
  ;

  ull inv_reduce(i128 v) const ;
};

//! https://www.mathenachia.blog/even-mod-montgomery-impl/
struct montgomery64
{
  ull m = 0, mx = 0, imx = 0, d = 0, q = 0;
  uint b = 0;
  montgomery64() = default;
  explicit montgomery64(ull m) : m(m)
  {
    b = countr_zero(m), mx = m >> b; 
    imx = inv64(mx);
    d = powmod_constexpr((mx + 1) / 2, b, mx); 
    u128 sq = -u128(mx) % mx; 
    q = (1 + (((sq - 1) * d) << b)) % m;
  }
  ull umod() const ;
  ull reduce(u128 x) const
  ;
  ull inv_reduce(i128 v) const ;
};

template <int id>
struct policy_montgomery64_odd
{
  using value_type = ull;
  using calc_type = u128;
  using mod_type = ll;

  static constexpr bool is_prime = false;
  static inline montgomery64odd reducer{};
  static void set_mod(mod_type m)
  ;

  static mod_type mod() ;
  static value_type umod() ;
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v) ;
  static value_type mul(value_type a, value_type b) ;
};

template <int id>
struct policy_montgomery64
{
  using value_type = ull;
  using calc_type = u128;
  using mod_type = ll;

  static constexpr bool is_prime = false;
  static inline montgomery64 reducer{};
  static void set_mod(mod_type m)
  ;

  static mod_type mod() ;
  static value_type umod() ;
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v) ;
  static value_type mul(value_type a, value_type b) ;
};

};

template <class T = ll>
constexpr tuple<T, T, T> extgcd(T a, T b)
;
namespace internal
{

  template <class Policy, class PowInv = void>
  struct modint_impl
  {
    using V = typename Policy::value_type;
    using M = typename Policy::mod_type;
    using mint = modint_impl;

  private:
    V _v;

  public:
    static constexpr M mod()
    {
      M m = Policy::mod();
      assert(m > 0 && "modint: modulus is not set; call mint::set_mod(m) before use");
      return m;
    }

    template <class T = Policy>
    static auto set_mod(M m) -> decltype(T::set_mod(m)) ;

    static mint raw(V v)
    ;

    modint_impl() : _v(0) { (void)mod(); }

    template <class T, typename = enable_if_t<is_integral_ext<T>>>
    modint_impl(T v)
    {
      const V m = mod();
      V rem;
      if constexpr (is_signed_ext<T>)
      {
        using S = make_signed_t<V>;
        S x = v % S(m);
        if (x < 0)
          x += m;
        rem = x;
      }
      else
        rem = V(v % m);
      _v = Policy::init(rem);
    };

    M val() const { return Policy::val(_v); }

    mint &operator+=(const mint &rhs)
    {
      _v += rhs._v;
      if (_v >= Policy::umod())
        _v -= Policy::umod();
      return *this;
    }
    mint &operator-=(const mint &rhs)
    {
      _v -= rhs._v;
      if (_v >= Policy::umod())
        _v += Policy::umod();
      return *this;
    }
    mint &operator*=(const mint &rhs)
    {
      _v = Policy::mul(_v, rhs._v);
      return *this;
    }
    mint &operator/=(const mint &rhs)
    {
      return *this *= rhs.inv();
    }

    mint &operator++()
    ;

    mint &operator--()
    ;

    mint operator++(int)
    ;

    mint operator--(int)
    ;

    mint operator+() const ;
    mint operator-() const ;

    template <class T>
    mint pow(T n) const
    {
      assert(n >= 0);
      if constexpr (!is_void_v<PowInv>)
        return raw(PowInv::get().pow(val(), n));
      mint x = *this, r = 1;
      while (n)
      {
        if (n & 1)
          r *= x;
        x *= x;
        n >>= 1;
      }
      return r;
    }
    mint inv() const
    {
      if constexpr (!is_void_v<PowInv>)
      {
        return raw(PowInv::get().inv(val()));
      }
      else if constexpr (Policy::is_prime)
      {
        return pow(mod() - 2);
      }
      else
      {
        auto [g, x, y] = extgcd<M>(val(), mod());
        assert(g == 1);
        return mint(x);
      }
    }

    friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }
    friend M safe_hash_key(const mint &x) { return x.val(); }
    friend void rd1(mint &x)
    {
      long long a;
      fastio::rd1(a);
      x = a;
    }
    friend void wt1(const mint &x)
    {
      fastio::wt1(x.val());
    }

  };

};

template <int mod>
using static_modint32 = internal::modint_impl<internal::policy_static<mod>>;
template <int id>
using dynamic_modint32 = internal::modint_impl<internal::policy_barrett32<id>>;
template <ll mod>
using static_modint64 = internal::modint_impl<internal::policy_static<mod>>;
template <int id>
using dynamic_modint64_odd = internal::modint_impl<internal::policy_montgomery64_odd<id>>;
template <int id>
using dynamic_modint64 = internal::modint_impl<internal::policy_montgomery64<id>>;

using modint998244353 = static_modint32<998244353>;
using modint1000000007 = static_modint32<1000000007>;
using modint = dynamic_modint32<-1>;
using modint61 = static_modint64<(1LL << 61) - 1>;
using modint64 = dynamic_modint64<-1>;

template <class T>
struct is_modint : std::false_type
{
};
template <class Policy, class PowInv>
struct is_modint<internal::modint_impl<Policy, PowInv>> : std::true_type
{
};
template <class T>
inline constexpr bool is_modint_v = is_modint<T>::value;

template <class T>
struct is_static_modint : false_type {};
template <int m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <ll m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <class T>
inline constexpr bool is_static_modint_v = is_static_modint<T>::value;

template <class T>
struct is_dynamic_modint : false_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint32<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64_odd<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64<id>> : true_type {};
template <class T>
inline constexpr bool is_dynamic_modint_v = is_dynamic_modint<T>::value;

template <typename, typename = void>
struct has_mod : std::false_type
{
};
template <typename T>
struct has_mod<T, std::void_t<decltype(T::mod())>> : std::true_type
{
};

template <class mint>
struct modint_less
{
  bool operator()(const mint &a, const mint &b) const
  ;

};

template <class mint>
struct modint_hash
{
  auto operator()(const mint &x) const
  ;

};

template <class mint>
struct PowerTable
{
private:
  decltype(mint::mod()) mod{};
  mint base{};
  vc<mint> pw;

public:
  CPP_DUMP_DEFINE_DATA(mod, base, pw);

  PowerTable() {}
  PowerTable(const mint &base) : mod(mint::mod()), base(base), pw(1, 1) {}

  void reserve(int n)
  ;
  mint pow(int n)
  ;

};

template <class T>
struct Binomial
{
private:
  inline static decltype(T::mod()) mod;

public:
  inline static vc<T> fac_, finv_, inv_;
  static void reserve(int n)
  ;
  static T fac(int n)
  ;

  static T finv(int n)
  ;

  static T inv(int n)
  ;

  static T P(int n, int k)
  ;

  static T C(int n, int k)
  ;
};

template <class mint>
mint stom(string s)
;
template <class T = ll, class U = larger_int_t<T>>
pair<T, T> svp2d(const pair<T, T> &a, const pair<T, T> &b)
;
template <class mint>
pair<decltype(mint(0).val()), decltype(mint(0).val())>
mint_to_rat(const mint &x)
{
  auto [p, q] = svp2d({x.val(), 1}, {mint::mod(), 0});
  if (q < 0)
    p = -p, q = -q;
  return {p, q};
}

namespace cpp_dump
{
  template <class T>
  struct rat_value
  {
    T p, q;

    friend ostream &operator<<(ostream &os, const rat_value &x)
    {
      os << x.p;
      if (x.q != 1)
        os << '/' << x.q;
      return os;
    }
  };

  struct mint_to_rat_fn
  {
    template <class T>
      requires requires(const T &x)
      {
        { T::mod() } -> std::convertible_to<ll>;
        { x.val() } -> std::convertible_to<ll>;
      }
    constexpr auto operator()(const T &x) const
        -> rat_value<typename decltype(mint_to_rat(x))::first_type>
    {
      auto [p, q] = mint_to_rat(x);
      return {p, q};
    }
  };

  template <class T>
  struct rat_object
  {
    T value;
  };

  template <class T>
  inline constexpr bool rat_is_map = false;
  template <class... Args>
  inline constexpr bool rat_is_map<std::map<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::multimap<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::unordered_map<Args...>> = true;
  template <class... Args>
  inline constexpr bool rat_is_map<std::unordered_multimap<Args...>> = true;

  struct rat_closure : std::ranges::range_adaptor_closure<rat_closure>
  {
    template <class T>
    static constexpr bool can_convert()
    ;
    template <typename T>
      requires(!requires { std::views::all | std::declval<T>(); })
    constexpr decltype(auto) operator()(T &&t) const
    {
      if constexpr (!std::ranges::range<T> && std::invocable<mint_to_rat_fn, T>)
      {
        return mint_to_rat_fn{}(std::forward<T>(t));
      }
      else if constexpr (can_convert<T>())
      {

        if constexpr (!std::ranges::range<T> || rat_is_map<std::remove_cvref_t<T>>)
          return rat_object<T>{std::forward<T>(t)};
        else
          return std::forward<T>(t) | std::views::transform(*this);
      }
      else
      {
        return std::forward<T>(t);
      }
    }
  };
  template <typename T>
    requires(!requires { std::views::all | std::declval<T>(); })
  constexpr decltype(auto) operator|(T &&t, rat_closure c)
  {
    return c(std::forward<T>(t));
  }

}

using mint = modint998244353;
// using mint = modint1000000007;
// using mint = static_modint<1000000000>;
// using mint = modint;
using bi = Binomial<mint>;

void init()
{
  oj(mt.seed(random_device()()));
}

// #include "math/fps/fps.hpp"
// using fps = FormalPowerSeries<mint>;

void main2()
{
  // LL(N, M);
  // fps f(M + 1);
  // rep(i, M - 1) f[i] = 1;
  // f[M] = 1;
  // fps md(M + 2);
  // md[0] = -1, md[M + 1] = 1;
  // fps g = f.pow_mod(N, md);
  // rep(i, M + 1) dump(i, f[i], (f % md)[i], g[i]);
  // PRINT(g[0] - 1);

  LL(N, M);
  PRINT((mint(M).pow(N) + 1) / (M + 1) - 1);
}

void test()
{

}

template <auto init, auto main2, auto test>
struct Main
{
  Main()
  {
    cauto CERR = [](string val, string color)
    {
      string s = "\033[" + color + "m" + val + "\033[m";

    };

    CERR("\n[FAST_IO]\n\n", "32");

    cout << fixed << setprecision(20);

    init();
    CERR("\n[SINGLE_TESTCASE]\n\n", "36");
    main2();
  }
};

Main<init, main2, test> main_dummy;
int main() {}


// submit-code: hash=4e1f25221cdf source=4e1f25221cdf382a28a83e6ee24f63721884bdfb6192cad39882e5cab31a020a input=c7d1d96723dade5193499f9674fc95a91b654a3eb1197221bd12e883fa9f1084 body=55e82580baf4a57e20f17cd262b8becb51c803b2137575502e6ef3f525aecaff
yukicoder

結果

ソースコード
