結果

問題 No.2762 Counting and Deleting
コンテスト
ユーザー miscalc
提出日時 2026-11-20 04:30:22
言語 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
結果
AC  
実行時間 111 ms / 4,000 ms
+ 434µs
コード長 93,002 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,829 ms
コンパイル使用メモリ 387,932 KB
実行使用メモリ 16,224 KB
最終ジャッジ日時 2026-11-20 04:30:30
合計ジャッジ時間 6,958 ms
ジャッジサーバーID
(参考情報)
judge4_0 / judge3_0
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff #
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
#line 30
#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
#line 103
//! https://gcc.gnu.org/onlinedocs/libquadmath/Math-Library-Routines.html
#line 289
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;
}
#line 337
#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__)
#line 408
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;
}
#line 512
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>;
#line 531
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>
constexpr make_unsigned_ext_t<T> unsigned_abs(T x)
;





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 R, class T>
constexpr R wrapping_cast(T x)
;
#line 625
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, size_t... I>
  constexpr T product_value(index_sequence<I...>)
  ;



  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>
  const T &custom_value()
  ;




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

template <class T>
constexpr decltype(auto) default_infty()
;
#line 696
template <class T, class U>
inline bool chmin(T &a, U b) ;
template <class T, class U>
inline bool chmax(T &a, U b) ;

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)
;
#line 720
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 divfloor(U a, V b) ;
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T divceil(U a, V 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)
;
#line 791
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)
;
#line 826
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)
;
#line 885
template <class T = ll, class A, class K>
constexpr T iroot_ceil(A a, K k)
;




//! https://misawa.github.io/others/avoid_errors/techniques_to_avoid_errors.html
template <class D = decltype(EPS), class A>
int SGN(A a, D eps = EPS) ;



template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base)
;
#line 915
template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base, int n)
;
#line 930
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)
;
#line 963
#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)
{
  assert(n >= 0);
  vc<decltype(f(0))> res;
  res.reserve(n);
  repi(i, n) res.eb(f(i));
  return res;
}
#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 T, size_t depth, class V>
void populate_dimensions(typename nested_vector<T, depth>::type &result, const V *sizes, const T &init)
;
#line 1008
template <class T, size_t depth, class V>
typename nested_vector<T, depth>::type build_dimensions(const V *sizes, const T &init)
;








}

template <class T, size_t d, size_t i = 0, class V>
auto dvec(const V (&sz)[d], const T &init)
;




template <class T, size_t d, size_t i = 0>
auto dvec(const ll (&sz)[d], const T &init)
;



template <class V, class T>
void fill(V &v, const T &value)
{
  if constexpr (is_assignable_v<decltype(*std::begin(v)), const T &>)
    std::fill(std::begin(v), std::end(v), value);
  else
    for (auto &row : v) fill(row, value);
}

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



template <class T = ll>
vc<T> stov(const string &s, char first)
{
  return gen_vec(SZ<int>(s), [&](int i) -> T
                 { return s[i] - first; });
}
template <class T = ll>
optional<vc<T>> stov(const string &s, const string &t)
;










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)
;




template <class T>
vc<T> merged(const vc<T> &a, const vc<T> &b)
;





template <class T, class I>
T vecget(const vc<T> &v, I i, const T &dflt_negative = -default_infty<T>(), const T &dflt_positive = default_infty<T>())
;
#line 1134
template <class T, auto x, enable_if_t<!is_invocable_v<decltype(x)>, int> = 0>
constexpr T resolved_value()
;



template <class T, auto x, enable_if_t<is_invocable_v<decltype(x)>, long> = 0>
const T &resolved_value()
;










template <class T, auto x = nullptr>
constexpr decltype(auto) resolved_infty()
;
#line 1170
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)
  {
    static_assert(is_integral_ext<I>);
    if constexpr (is_signed_ext<I>) assert(k >= 0);
  }

  template <class M, class I>
  constexpr typename M::S binary_inplace(typename M::S &x, I k)
  {
    typename M::S res = M::e();
    if (k & 1) res = M::op(res, x);
    for (k >>= 1; k; k >>= 1)
    {
      x = M::op(x, x);
      if (k & 1) res = M::op(res, x);
    }
    return res;
  }

  template <class M, class I>
  constexpr typename M::S binary(typename M::S x, I k)
  {
    check_exponent(k);
    return binary_inplace<M>(x, k);
  }
}


template <class M, class I>
constexpr typename M::S pow_monoid(typename M::S x, I k)
{
  if constexpr (is_signed_ext<I>) assert(k >= 0);
  if constexpr (internal::HasMonoidPow<M, I>::value)
    return M::pow(x, k);
  else
    return internal_monoid_power::binary_inplace<M>(x, k);
}


template <class G, class I>
constexpr typename G::S pow_group(typename G::S x, I k)
;
#line 1238
template <class V>
auto SUM(const V &v)
;




template <class T, class V>
T SUM(const V &v)
;




template <class V>
auto MAX(const V &v) ;
template <class V>
auto MIN(const V &v) ;
template <class I = ll, class V>
optional<I> ARGMAX(const V &v)
;



template <class I = ll, class V>
optional<I> ARGMIN(const V &v)
;




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








template <class I>
bool is_permutation(const vc<I> &p)
;
#line 1295
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>
V reversed(const V &v) ;









template <class V, class... Args>
V sorted(V v, Args&&... args)
;





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 Equal = equal_to<>>
V uniqued(V v, Equal equal = {}) ;

template <class V, class Compare = less<>, class Equal = equal_to<>>
void sortunique(V &v, Compare comp = {}, Equal equal = {})
;



template <class V, class Compare = less<>, class Equal = equal_to<>>
V sortuniqued(V v, Compare comp = {}, Equal equal = {})
;


template <class V, class U>
void rotate(V &v, U k)
;







template <class V, class U>
V rotated(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) { return a + b; }
  static constexpr S e()
  {
    if constexpr (has_e0_v<S>)
      return S::e0();
    else
      return {};
  }
  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) { return min(a, b); }
  static constexpr decltype(auto) e() { return resolved_infty<T, infty>(); }
  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) { return max(a, b); }
  static constexpr S e() { return -resolved_infty<T, infty>(); }
  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 M>
vc<typename M::S> cumr(const vc<typename M::S> &v, int right_index = 0)
;
template <class T>
vc<T> cumlsum(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrsum(const vc<T> &v, int right_index = 0)
;
template <class T>
vc<T> cumlmin(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrmin(const vc<T> &v, int right_index = 0)
;
template <class T>
vc<T> cumlmax(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrmax(const vc<T> &v, int right_index = 0)
;



template <class T>
vc<T> adjd(const vc<T> &v, int left_index = 0, int right_index = 0)
;
#line 1504
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;
#line 1569
template <class T = ll, class V, class Value, class Comp = ranges::less, class Proj = identity>
inline T LB(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
;

template <class T = ll, class V, class Value, class Comp = ranges::less, class Proj = identity>
inline T UB(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
;
#define DEFAULT_COMP ranges::less





template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto lt_max(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;




template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto leq_max(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;




template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto gt_min(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto geq_min(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto lt_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto leq_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto gt_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto geq_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;

template <class T = ll, class V, class L, class R, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto in_cnt(const V &v, L l, R r, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;








template <class V, class Value>
inline auto lt_max(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;





template <class V, class Value>
inline auto leq_max(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;





template <class V, class Value>
inline auto gt_min(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;





template <class V, class Value>
inline auto geq_min(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;







namespace internal
{
template <class T>
bool binsearch_adjacent(T a, T b)
;






};


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)
;
#line 1707
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)
;
#line 1723
template <class T = ll, class Judge, class InitVal>
pair<T, T> expsearch(const Judge &judge, InitVal init_val, bool positive = true)
;
#line 1769
template <class T>
inline constexpr ull pow2(T k) ;
template <class T>
inline constexpr ull MASK(T k) { return (1ULL << k) - 1ULL; }
#line 1787
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); }

inline constexpr bool btest(ull x, uint k) { return (x >> k) & 1; }
template <class T>
inline void bset(T &x, uint k, bool b = 1) ;
template <class T>
inline void bflip(T &x, uint k) ;
inline constexpr bool bsubset(ull x, ull y) { return (x & y) == x; }
inline constexpr bool bsupset(ull x, ull y) { return (x & y) == y; }
inline constexpr ull bsetminus(ull x, ull y) { return x & ~y; }
#line 1912
#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(); }
#line 1977
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;
  }

  inline void find_token()
  {
    for (;;)
    {
      const char *p = ibuf + pil;
      const char *end = ibuf + pir;
      while (ascii_space(*p)) ++p;
      pil = uint32_t(p - ibuf);
      if (p != end) return;
      load();
      if (!pir) abort();
    }
  }

  __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_bytes(const char *data, size_t size)
  {
    while (size)
    {
      const size_t n = min(size, size_t(SIZ - por));
      memcpy(obuf + por, data, n);
      por += uint32_t(n);
      data += n;
      size -= n;
      if (por == SIZ) flush();
    }
  }

  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 uint decode_eight(uint64_t columns)
  {
    columns &= 0x0f0f0f0f0f0f0f0fULL;
    const uint64_t pairs = (columns & 0x00ff00ff00ff00ffULL) * 10
                         + ((columns >> 8) & 0x00ff00ff00ff00ffULL);
    const uint64_t quads = (pairs & 0x0000ffff0000ffffULL) * 100
                         + ((pairs >> 16) & 0x0000ffff0000ffffULL);
    return uint(quads) * 10000 + uint(quads >> 32);
  }

  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)
  ;
#line 2078
  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)
  {
    find_token();
    x.clear();
    for (;;)
    {
      const char *p = ibuf + pil;
      const char *end = ibuf + pir;
      const char *first = p;
      while (p != end && !ascii_space(*p)) ++p;
      x.append(first, size_t(p - first));
      pil = uint32_t(p - ibuf);
      if (p != end) return;
      load();
      if (!pir) return;
    }
  }

  template <class T>
  void rd1_real(T &x)
  {
    string token;
    rd1(token);
    const char *first = token.data();
    const char *last = first + token.size();
    if (first != last && *first == '+') ++first;
    auto result = from_chars(first, last, x, chars_format::general);
    if (result.ec != errc{} || result.ptr != last)
    {
      char *end;
      if constexpr (is_same_v<T, float>) x = strtof(token.c_str(), &end);
      else if constexpr (is_same_v<T, double>) x = strtod(token.c_str(), &end);
      else x = strtold(token.c_str(), &end);
      if (end != token.data() + token.size()) abort();
    }
  }
  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 *prepend_small(char *end, uint x)
  {
    while (x >= 1000)
    {
      const uint q = x / 1000;
      end -= 3;
      memcpy(end, decimal_triplets[x - q * 1000].data(), 3);
      x = q;
    }
    const unsigned digits = 1 + unsigned(x >= 10) + unsigned(x >= 100);
    end -= digits;
    memcpy(end, decimal_triplets[x].data() + 3 - digits, digits);
    return end;
  }

  inline char *prepend_wide(char *end, ull x)
  {
    while (x >= 1000000000ULL)
    {
      const ull q = x / 1000000000ULL;
      end -= 9;
      store_nine(end, uint(x - q * 1000000000ULL));
      x = q;
    }
    return prepend_small(end, uint(x));
  }

  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)
  ;
#line 2386
  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) ;

  template <class T>
  void wt1_real(T x)
  {
    char text[numeric_limits<T>::max_exponent10 + 64];
    auto result = to_chars(text, text + sizeof(text), x, chars_format::fixed, 15);
    if (result.ec != errc{}) abort();
    append_bytes(text, size_t(result.ptr - text));
  }
  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/
#line 2532
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)
;
#line 2579
};

#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'
#line 2688
#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)
;
#line 2737
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 <size_t... I, class V, class Tp>
auto vt_to_tv_impl(V &tv, const Tp &t, index_sequence<I...>, size_t index)
;

template <size_t... I, class Tp>
auto tv_to_vt_impl(const Tp &tv, index_sequence<I...>, size_t index)
;

};

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)
;
#line 2888
};



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)
;
#line 2917
/*!
 * 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
 */
#line 2936
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)
  {
    const calc_type product = calc_type(a) * b;
    if constexpr (M == (1LL << 61) - 1)
    {
      const value_type reduced = (value_type(product) & umod()) + value_type(product >> 61);
      return reduced >= umod() ? reduced - umod() : reduced;
    }
    else
      return value_type(product % 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
  ;
#line 3229
  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)
;
#line 3311
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 void precompute()
    ;




    static mint raw(V v)
    {
      mint x;
      x._v = v;
      return x;
    }

    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)
    ;





    mint &operator*=(const mint &rhs)
    {
      _v = Policy::mul(_v, rhs._v);
      return *this;
    }
    mint &operator/=(const mint &rhs)
    ;





    mint &operator++()
    ;





    mint &operator--()
    ;





    mint operator++(int)
    ;




    mint operator--(int)
    ;




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

    template <class T>
    mint pow(T n) const
    ;
#line 3441
    mint inv() const
    ;
#line 3459
    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(); }
#line 3481
    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)
  ;
#line 3614
  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)
  ;
#line 3666
  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)
  ;









  static T H(int n, int k)
  ;




};









template <class mint>
mint stom(string s)
;
#line 3759
template <class T = ll, class U = larger_int_t<T>>
pair<T, T> svp2d(const pair<T, T> &a, const pair<T, T> &b)
;
#line 3797
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()
    ;
#line 3889
    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);
      }
    }
  };
#line 3960
  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));
  }

  constexpr rat_closure rat()
  {
    return rat_closure{};
  }
}




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()()));
}











struct SegmentTreeRange
{
private:
  int n;
  ll siz;

  void check_node(ll i) const { assert(1 <= i && i < 2 * siz); }

public:
  CPP_DUMP_DEFINE_DATA(n, siz);

  explicit SegmentTreeRange(int n) : n(n), siz(1)
  {
    assert(0 <= n);
    siz = bit_ceil(ll(n));
  }

  int size() const ;
  ll leaf_size() const { return siz; }
  ll node_count() const { return 2 * siz - 1; }

  int depth(ll i) const
  {
    check_node(i);
    return bit_width(i) - 1;
  }
  bool is_leaf(ll i) const
  {
    check_node(i);
    return siz <= i;
  }
  ll range_length(ll i) const { return siz >> depth(i); }


  pair<ll, ll> node_to_range(ll i) const
  {
    const int d = depth(i);
    const ll len = siz >> d, l = (i - (1LL << d)) * len;
    return {l, l + len};
  }
  ll range_to_node(ll l, ll r) const
  {
    assert(0 <= l && l < r && r <= siz);
    const ll len = r - l;
    assert(has_single_bit(len) && l % len == 0);
    return (siz + l) / len;
  }
  ll point_to_node(int p) const
  {
    assert(0 <= p && p < n);
    return siz + p;
  }
  int node_to_point(ll i) const
  {
    assert(siz <= i && i < siz + n);
    return i - siz;
  }

  template <class Iter>
  struct NodeRange
  {
    Iter first;
    Iter begin() const ;
    Iter end() const ;
    bool empty() const ;
    vc<ll> to_v() const ;
  };

  template <bool from_left>
  struct RangeIterator
  {
    using iterator_category = input_iterator_tag;
    using value_type = ll;
    using difference_type = ptrdiff_t;
    using reference = ll;
    using pointer = void;

  private:
    ll l = 0, r = 0, i = 0;

    void advance()
    {
      if constexpr (from_left)
      {
        if (l < r)
        {
          const ll len = min<ll>(lsb_mask(l), bit_floor(r - l));
          i = l / len;
          l += len;
          return;
        }
      }
      else
      {
        while (l < r)
        {
          if (l & 1)
          {
            i = l++;
            return;
          }
          if (r & 1)
          {
            i = --r;
            return;
          }
          l >>= 1, r >>= 1;
        }
      }
      l = r = i = 0;
    }

  public:
    RangeIterator() = default;
    RangeIterator(ll l, ll r) : l(l), r(r) { advance(); }
    ll operator*() const ;
    RangeIterator &operator++()
    ;



    RangeIterator operator++(int)
    ;




    bool operator==(const RangeIterator &other) const
    ;


    bool operator!=(const RangeIterator &other) const ;
  };

  template <bool from_top>
  struct AncestorIterator
  {
    using iterator_category = input_iterator_tag;
    using value_type = ll;
    using difference_type = ptrdiff_t;
    using reference = ll;
    using pointer = void;

  private:
    ll target = 0, i = 0;
    int shift = 0;

  public:
    AncestorIterator() = default;
    explicit AncestorIterator(ll target) : target(target), i(target)
    {
      if constexpr (from_top)
      {
        shift = bit_width(target) - 1;
        i = 1;
      }
    }
    ll operator*() const ;
    AncestorIterator &operator++()
    ;






    AncestorIterator operator++(int)
    ;




    bool operator==(const AncestorIterator &other) const
    ;


    bool operator!=(const AncestorIterator &other) const ;
  };

  auto range_to_nodes_from_left(int l, int r) const
  {
    assert(0 <= l && l <= r && r <= n);
    return NodeRange<RangeIterator<true>>{RangeIterator<true>(siz + l, siz + r)};
  }
  auto range_to_nodes_from_bottom(int l, int r) const
  {
    assert(0 <= l && l <= r && r <= n);
    return NodeRange<RangeIterator<false>>{RangeIterator<false>(siz + l, siz + r)};
  }


  auto ancestors_from_bottom(ll i) const
  {
    check_node(i);
    return NodeRange<AncestorIterator<false>>{AncestorIterator<false>(i)};
  }
  auto ancestors_from_top(ll i) const
  {
    check_node(i);
    return NodeRange<AncestorIterator<true>>{AncestorIterator<true>(i)};
  }
  auto point_to_nodes_from_bottom(int p) const { return ancestors_from_bottom(point_to_node(p)); }
  auto point_to_nodes_from_top(int p) const { return ancestors_from_top(point_to_node(p)); }
};







template <class M>
struct RangeAssignSegmentTree
{
  using S = typename M::S;

private:
  int n;
  ll siz;
  vc<S> dat;
  vc<optional<S>> assigned;

  void set_node(ll i, const S &unit, const S &value)
  {
    dat[i] = value;
    if (i < siz) assigned[i] = unit;
  }

  void preserve_outside(ll i, int height, ll l, ll r)
  {
    ll prefix = max(0LL, l - (i << height));
    ll suffix = max(0LL, ((i + 1) << height) - r);
    const S &unit = *assigned[i];
    S power = unit;
    for (int h = 0; ; ++h)
    {
      if (prefix & 1)
      {
        l -= 1LL << h;
        set_node(l >> h, unit, power);
      }
      if (suffix & 1)
      {
        set_node(r >> h, unit, power);
        r += 1LL << h;
      }
      prefix >>= 1, suffix >>= 1;
      if ((prefix | suffix) == 0) break;
      power = M::op(power, power);
    }
  }

  bool expose(ll leaf, int top, int bottom, ll l, ll r)
  {
    for (int h = top; h >= bottom; --h)
    {
      const ll i = leaf >> h;
      if (assigned[i])
      {
        preserve_outside(i, h, l, r);
        return true;
      }
    }
    return false;
  }

  void pull(ll i)
  {
    assigned[i].reset();
    dat[i] = M::op(dat[2 * i], dat[2 * i + 1]);
  }

  static S uniform_prod(const S &unit, ll len)
  {
    return len == 1 ? unit : pow_monoid<M>(unit, len);
  }

  template <bool from_right>
  S border_prod(ll i, ll width, ll len) const
  ;
#line 4293
  template <class X, class F>
  void apply_range(ll i, ll a, ll b, ll l, ll r, X &x, F &apply) const
  {
    if (l == a && r == b)
    {
      const S &value = dat[i];
      x = apply(x, value);
      return;
    }
    if (assigned[i])
    {
      ll len = r - l;
      if constexpr (internal::HasMonoidPow<M, ll>::value)
      {
        const S value = uniform_prod(*assigned[i], len);
        x = apply(x, value);
      }
      else
      {
        S power = *assigned[i];
        while (len > 3)
        {
          if (len & 1) x = apply(x, as_const(power));
          len >>= 1;
          power = M::op(power, power);
        }
        for (; len > 0; --len) x = apply(x, as_const(power));
      }
      return;
    }
    const ll mid = a + (b - a) / 2;
    if (l < mid) apply_range(2 * i, a, mid, l, min(r, mid), x, apply);
    if (mid < r) apply_range(2 * i + 1, mid, b, max(l, mid), r, x, apply);
  }

  template <bool from_right>
  static S join(const S &acc, const S &value)
  ;




  template <bool from_right, class G>
  static ll search_uniform(const S &unit, ll l, ll r, S &acc, const G &g)
  ;
#line 4357
  template <bool from_right, class G>
  ll search(ll i, ll a, ll b, ll l, ll r, S &acc, const G &g) const
  ;
#line 4381
public:
  RangeAssignSegmentTree() : RangeAssignSegmentTree(0) {}
  explicit RangeAssignSegmentTree(int n)
      : n(n), siz(SegmentTreeRange(n).leaf_size()), dat(2 * siz, M::e()), assigned(siz) {}
  RangeAssignSegmentTree(int n, const S &x) : RangeAssignSegmentTree(n) { set(0, n, x); }

  template <class T>
  explicit RangeAssignSegmentTree(const vc<T> &a) : RangeAssignSegmentTree(SZ(a))
  {
    for (int p = 0; p < n; ++p) dat[siz + p] = a[p];
    for (ll i = siz - 1; i > 0; --i) dat[i] = M::op(dat[2 * i], dat[2 * i + 1]);
  }

  int size() const ;

  void set(int l, int r, const S &x)
  {
    assert(0 <= l && l <= r && r <= n);
    if (l == r) return;
    const S unit = x;
    const ll left = siz + l, right = siz + r;
    const int height = countr_zero(siz), split = bit_width(left ^ (right - 1));
    const int left_start = countr_zero(left) + 1, right_start = countr_zero(right) + 1;
    const int common_start = max(split, min(left_start, right_start));
    if (!expose(left, height, common_start, left, right))
    {
      expose(left, split - 1, left_start, left, right);
      expose(right - 1, split - 1, right_start, left, right);
    }

    S power = unit;
    for (ll a = left, b = right; ; )
    {
      if (a & 1) set_node(a++, unit, power);
      if (b & 1) set_node(--b, unit, power);
      a >>= 1, b >>= 1;
      if (a >= b) break;
      power = M::op(power, power);
    }

    for (int h = left_start; h < split; ++h) pull(left >> h);
    for (int h = right_start; h < split; ++h) pull((right - 1) >> h);
    for (int h = common_start; h <= height; ++h) pull(left >> h);
  }

  void set(int p, const S &x)
  ;




  S prod(int l, int r) const
  ;
#line 4449
  S get(int p) const
  {
    assert(0 <= p && p < n);
    const ll leaf = siz + p;
    for (int h = countr_zero(siz); h > 0; --h)
      if (const auto &unit = assigned[leaf >> h]) return *unit;
    return dat[leaf];
  }

  S all_prod() const ;



  template <class X, class F>
  X prod_apply(int l, int r, X x, F &&apply) const
  {
    assert(0 <= l && l <= r && r <= n);
    if (l < r) apply_range(1, 0, siz, l, r, x, apply);
    return x;
  }


  template <class G>
  int max_right_ok(int l, const G &g) const
  ;









  template <class G>
  int min_left_ok(int r, const G &g) const
  ;








  vc<S> content() const
  ;
#line 4513
};










namespace internal_monoid_power
{
  template <class T, class I, class = void>
  struct HasMemberScalarProduct : false_type {};
  template <class T, class I>
  struct HasMemberScalarProduct<T, I, void_t<decltype(T(declval<const T &>().operator*({declval<I>()})))>> : true_type {};
  template <class T, class I, class = void>
  struct HasFreeScalarProduct : false_type {};
  template <class T, class I>
  struct HasFreeScalarProduct<T, I, void_t<decltype(T(operator*(declval<const T &>(), {declval<I>()})))>> : true_type {};
  template <class T, class I>
  struct HasScalarProduct : bool_constant<is_arithmetic_v<T> || is_same_v<T, f128> ||
                                         HasMemberScalarProduct<T, I>::value || HasFreeScalarProduct<T, I>::value> {};

  template <class T, class I>
  constexpr T scalar_product(const T &x, I k)
  ;






  template <class T, class I>
  constexpr T scale(const T &x, I k)
  ;
#line 4573
  template <class T, class I>
  constexpr T bounded_scale(const T &x, I k, const T &cap)
  ;
#line 4598
  template <class M, class I>
  using ConstRefPower = typename M::S (*)(const typename M::S &, I);
  template <class M, class I>
  using ValuePower = typename M::S (*)(typename M::S, I);
  template <class M, class I, class = void>
  struct HasConstRefPower : false_type {};
  template <class M, class I>
  struct HasConstRefPower<M, I, void_t<decltype(static_cast<ConstRefPower<M, I>>(M::pow))>> : true_type {};
  template <class M, class I, class = void>
  struct HasValuePower : false_type {};
  template <class M, class I>
  struct HasValuePower<M, I, void_t<decltype(static_cast<ValuePower<M, I>>(M::pow))>> : true_type {};

  template <class M, class I>
  constexpr typename M::S power(const typename M::S &x, I k)
  {
    if constexpr (is_signed_ext<I>) assert(k >= 0);
    if constexpr (HasConstRefPower<M, I>::value || HasValuePower<M, I>::value ||
                  (!is_integral_ext<I> && internal::HasMonoidPow<M, I>::value))
      return M::pow(x, k);
    else
      return binary<M>(x, k);
  }
}







template <class S_, auto op_, auto e_>
struct Monoid
{
  using S = S_;
  static constexpr auto op = op_;
  static constexpr auto e = e_;
};

template <class S_, auto op_, auto e_, auto inv_>
struct Group
{
  using S = S_;
  static constexpr auto op = op_;
  static constexpr auto e = e_;
  static constexpr auto inv = inv_;
};

template <class S_, auto add_, auto e0_, auto mul_, auto e1_>
struct SemiRing
{
  using S = S_;
  static constexpr auto add = add_;
  static constexpr auto e0 = e0_;
  static constexpr auto mul = mul_;
  static constexpr auto e1 = e1_;
};

template <class S_, auto add_, auto e0_, auto minus_, auto mul_, auto e1_>
struct Ring
{
  using S = S_;
  static constexpr auto add = add_;
  static constexpr auto e0 = e0_;
  static constexpr auto minus = minus_;
  static constexpr auto mul = mul_;
  static constexpr auto e1 = e1_;
};

template <class S_, auto add_, auto e0_, auto minus_, auto mul_, auto e1_, auto inv_>
struct Field
{
  using S = S_;
  static constexpr auto add = add_;
  static constexpr auto e0 = e0_;
  static constexpr auto minus = minus_;
  static constexpr auto mul = mul_;
  static constexpr auto e1 = e1_;
  static constexpr auto inv = inv_;
};

template <class M, class = void>
struct HasInverse : false_type {};
template <class M>
struct HasInverse<M, void_t<decltype(M::inv(declval<const typename M::S &>()))>> : true_type {};

template <class M>
struct OppositeMonoid
{
  using S = typename M::S;
  static constexpr S op(const S &a, const S &b) { return M::op(b, a); }
  static constexpr auto e = M::e;
  template <class I>
  static constexpr S pow(const S &x, I k) { return internal_monoid_power::power<M>(x, k); }
};
template <class G>
struct OppositeGroup
{
  using S = typename G::S;
  static constexpr S op(const S &a, const S &b) { return G::op(b, a); }
  static constexpr auto e = G::e;
  static constexpr auto inv = G::inv;
  template <class I>
  static constexpr S pow(const S &x, I k) { return internal_monoid_power::power<G>(x, k); }
};
template <class M>
struct NormalAndOppositeMonoid
{
  struct S
  {
    typename M::S normal;
    typename M::S opposite;
    S() {}
    template <class... Args,
              std::enable_if_t<std::is_constructible_v<typename M::S, Args...>, std::nullptr_t> = nullptr>
    S(Args &&...args)
        : normal(std::forward<Args>(args)...), opposite(normal) {}
    S rev() ;
    S(const typename M::S &normal, const typename M::S &opposite) : normal(normal), opposite(opposite) {}
  };
  static constexpr S op(const S &a, const S &b) { return {M::op(a.normal, b.normal), M::op(b.opposite, a.opposite)}; }
  static constexpr S e() { return {M::e(), M::e()}; }
  template <class I>
  static constexpr S pow(const S &x, I k) { return {internal_monoid_power::power<M>(x.normal, k), internal_monoid_power::power<M>(x.opposite, k)}; }
};
template <class G>
struct NormalAndOppositeGroup
{
  struct S
  {
    typename G::S normal;
    typename G::S opposite;
    S() {}
    template <class... Args,
              std::enable_if_t<std::is_constructible_v<typename G::S, Args...>, std::nullptr_t> = nullptr>
    S(Args &&...args)
        : normal(std::forward<Args>(args)...), opposite(normal) {}
    S rev() ;
    S(const typename G::S &normal, const typename G::S &opposite) : normal(normal), opposite(opposite) {}
  };
  static constexpr S op(const S &a, const S &b) { return {G::op(a.normal, b.normal), G::op(b.opposite, a.opposite)}; }
  static constexpr S e() { return {G::e(), G::e()}; }
  static constexpr S inv(const S &a) { return {G::inv(a.normal), G::inv(a.opposite)}; }
  template <class I>
  static constexpr S pow(const S &x, I k) { return {internal_monoid_power::power<G>(x.normal, k), internal_monoid_power::power<G>(x.opposite, k)}; }
};

template <class SR>
using MonoidOfSemiRingAdd = Monoid<typename SR::S, SR::add, SR::e0>;
template <class SR>
using MonoidOfSemiRingMul = Monoid<typename SR::S, SR::mul, SR::e1>;
template <class R>
using GroupOfRingAdd = Group<typename R::S, R::add, R::e0, R::minus>;
template <class K>
using GroupOfFieldMul = Group<typename K::S, K::mul, K::e1, K::inv>;


template <class Madd, class Mmul>
struct SemiRingFromMonoidMonoid
{
  static_assert(is_same_v<typename Madd::S, typename Mmul::S>, "Madd::S and Mmul::S must be identical");
  using S = typename Madd::S;
  static constexpr auto add = Madd::op;
  static constexpr auto e0 = Madd::e;
  static constexpr auto mul = Mmul::op;
  static constexpr auto e1 = Mmul::e;
};


template <class Gadd, class Mmul>
struct RingFromGroupMonoid
{
  static_assert(is_same_v<typename Gadd::S, typename Mmul::S>, "Gadd::S and Mmul::S must be identical");
  using S = typename Gadd::S;
  static constexpr auto add = Gadd::op;
  static constexpr auto e0 = Gadd::e;
  static constexpr auto minus = Gadd::inv;
  static constexpr auto mul = Mmul::op;
  static constexpr auto e1 = Mmul::e;
};


template <class Gadd, class Gmul>
struct FieldFromGroupGroup
{
  static_assert(is_same_v<typename Gadd::S, typename Gmul::S>, "Gadd::S and Gmul::S must be identical");
  using S = typename Gadd::S;
  static constexpr auto add = Gadd::op;
  static constexpr auto e0 = Gadd::e;
  static constexpr auto minus = Gadd::inv;
  static constexpr auto mul = Gmul::op;
  static constexpr auto e1 = Gmul::e;
  static constexpr auto inv = Gmul::inv;
};











template <class T, class = void>
struct has_e1 : false_type {};
template <class T>
struct has_e1<T, void_t<decltype(T::e1())>> : true_type {};
template <class T>
inline constexpr bool has_e1_v = has_e1<T>::value;

template <class T>
struct MonoidMul
{
  using S = T;
  static constexpr S op(S a, S b) { return a * b; }
  static constexpr S e()
  {
    if constexpr (has_e1_v<S>)
      return S::e1();
    else
      return 1;
  }
};

template <class T>
struct GroupAddSub
{
  using S = T;
  static constexpr S op(S a, S b) { return a + b; }
  static constexpr S e()
  {
    if constexpr (has_e0_v<S>)
      return S::e0();
    else
      return S{};
  }
  static constexpr S inv(S a) { return -a; }
  template <class I, class = decltype(declval<S>() * declval<I>())>
  static constexpr S pow(const S &a, I k) { return a * k; }
};
template <class T>
struct GroupMulDiv
{
  using S = T;
  static constexpr S op(S a, S b) { return a * b; }
  static constexpr S e()
  {
    if constexpr (has_e1_v<S>)
      return S::e1();
    else
      return S(1);
  }
  static constexpr S inv(S a) { return e() / a; }
};

template <class T, auto infty = nullptr>
using SemiRingMinPlus = SemiRingFromMonoidMonoid<MonoidMin<T, infty>, MonoidAdd<T>>;
template <class T, auto infty = nullptr>
using SemiRingMaxPlus = SemiRingFromMonoidMonoid<MonoidMax<T, infty>, MonoidAdd<T>>;
template <class T>
using RingAddSubMul = RingFromGroupMonoid<GroupAddSub<T>, MonoidMul<T>>;
template <class T>
using FieldAddSubMulDiv = FieldFromGroupGroup<GroupAddSub<T>, GroupMulDiv<T>>;
#line 4875
namespace internal
{
template <class S>
struct ordinary_mod32 : false_type {};
template <int mod, class PowInv>
struct ordinary_mod32<modint_impl<policy_static<mod>, PowInv>> : true_type {};
template <int id>
struct ordinary_mod32<dynamic_modint32<id>> : true_type {};

}


namespace internal
{
template <class G>
struct ordinary_mod32_add_group : false_type {};
template <class S>
struct ordinary_mod32_add_group<GroupAddSub<S>> : ordinary_mod32<S> {};
template <class S>
struct ordinary_mod32_add_group<Group<S, GroupAddSub<S>::op, GroupAddSub<S>::e, GroupAddSub<S>::inv>>
    : ordinary_mod32<S> {};

template <class F>
struct ordinary_mod32_field : false_type {};
template <class S>
struct ordinary_mod32_field<FieldAddSubMulDiv<S>> : ordinary_mod32<S> {};
}





#include <algorithm>
#include <cstddef>
#include <cstdint>

namespace internal
{



template <class NextProduct>
inline std::uint32_t block_dot32(std::size_t n, std::uint32_t mod, std::size_t block,
                                 std::uint32_t seed, NextProduct next)
{
  std::uint64_t carry = seed;
  while (n)
  {
    const std::size_t count = std::min(n, block);
    std::size_t i = 0;
    std::uint64_t s0 = carry, s1 = 0, s2 = 0, s3 = 0;
    for (; i + 4 <= count; i += 4)
    {
      s0 += next();
      s1 += next();
      s2 += next();
      s3 += next();
    }
    for (; i < count; ++i) s0 += next();
    carry = (s0 + s1 + s2 + s3) % mod;
    n -= count;
  }
  return static_cast<std::uint32_t>(carry);
}

}


namespace internal
{
template <class S>
using dot_product_mod32_value = ordinary_mod32<S>;

template <int block, class S, class It1, class It2>
S dot_product_mod32_impl(int n, It1 a, It2 b)
{
  return S::raw(block_dot32(n, S::mod(), block, 0, [&]()
  {
    return ull((a++)->val()) * (b++)->val();
  }));
}

template <class S, class It1, class It2>
S dot_product_mod32_values(int n, It1 a, It2 b)
{
  static_assert(ordinary_mod32<S>::value);
  assert(n >= 0);
  if (S::mod() <= (1 << 30)) return dot_product_mod32_impl<16, S>(n, a, b);
  return dot_product_mod32_impl<4, S>(n, a, b);
}
}







namespace internal
{
template <class SR>
struct dot_product_mod32 : false_type {};
template <class S>
struct dot_product_mod32<FieldAddSubMulDiv<S>> : dot_product_mod32_value<S> {};
template <class S>
struct dot_product_mod32<RingAddSubMul<S>> : dot_product_mod32_value<S> {};
template <class S>
struct dot_product_mod32<SemiRingFromMonoidMonoid<MonoidAdd<S>, MonoidMul<S>>>
    : dot_product_mod32_value<S> {};


}



template <class SR, class It1, class It2>
typename SR::S dot_product(int n, It1 a, It2 b)
{
  using S = typename SR::S;
  assert(n >= 0);
  if constexpr (internal::dot_product_mod32<SR>::value)
  {
    return internal::dot_product_mod32_values<S>(n, a, b);
  }
  else
  {
    S sum = SR::e0();
    repi(i, n) sum = SR::add(sum, SR::mul(*a++, *b++));
    return sum;
  }
}







//! https://codeforces.com/blog/entry/61306






template <class F>
struct BerlekampMassey
{
  using S = typename F::S;
  vc<S> a, b, c, tmp;
  int pos = -1;
  S inv_x = F::e0();
  CPP_DUMP_DEFINE_DATA(a, c, pos);

  int degree() const ;

  void append(S value)
  {
    const int i = a.size(), d = c.size();
    a.eb(value);
    S y = F::add(value, F::minus(dot_product<F>(d, c.begin(), a.rbegin() + 1)));
    if (y == F::e0())
      return;

    if (c.empty())
    {
      c.assign(i + 1, F::e0());
      pos = i;
      inv_x = F::inv(y);
      return;
    }

    S z = F::mul(y, inv_x);
    int d2 = i - pos + b.size();
    if (d2 > d)
    {
      tmp = c;
      c.resize(d2, F::e0());
    }
    c[i - 1 - pos] = F::add(c[i - 1 - pos], z);
    const S minus_z = F::minus(z);
    repi(j, b.size()) c[i - pos + j] = F::add(c[i - pos + j], F::mul(minus_z, b[j]));
    if (d2 > d)
      pos = i, inv_x = F::inv(y), swap(tmp, b);
  }

  vc<S> coefficients() const
  ;






};

template <class F>
vc<typename F::S> berlekamp_massey(const vc<typename F::S> &a)
;
#line 5089
template <class mint = modint998244353, bool nonzero = false>
mint random_modint()
;









//! https://yukicoder.me/wiki/black_box_linear_algebra

namespace bbla
{

template <class mint>
mint random_sample_mint() ;


template <class F, class LinearMap>
vc<typename F::S> krylov_sequence(const LinearMap &linear_map, const vc<typename F::S> &u,
                                 vc<typename F::S> v, int count)
;
#line 5126
template <class F, class LinearMap>
vc<typename F::S> apply_polynomial(const LinearMap &linear_map,
                                  const vc<typename F::S> &v, const vc<typename F::S> &p)
;
#line 5147
template <class F, class LinearMap, class RandomSample = decltype(random_sample_mint<typename F::S>)>
vc<typename F::S> minimal_polynomial_vector(const LinearMap &linear_map, vc<typename F::S> v,
                                            const RandomSample &random_sample = random_sample_mint)
;
#line 5163
template <class F, class LinearMap, class RandomSample = decltype(random_sample_mint<typename F::S>)>
vc<typename F::S> minimal_polynomial(int n, const LinearMap &linear_map, const RandomSample &random_sample = random_sample_mint)
;
#line 5178
template <class F, class LinearMap, class RandomSample = decltype(random_sample_mint<typename F::S>)>
vc<typename F::S> solve(const LinearMap &linear_map, vc<typename F::S> y, const RandomSample &random_sample = random_sample_mint)
;
#line 5221
template <class F, class LinearMap, class RandomSample = decltype(random_sample_mint<typename F::S>)>
typename F::S det(int n, const LinearMap &linear_map, const RandomSample &random_sample = random_sample_mint)
;
#line 5252
}









template <class T, bool is_erasable = false>
struct CSR
{
protected:
  int n, m;


  vc<int> start;
  vc<T> elist;
  vc<int> len;
  inline int get_last(int i) const
  {
    if constexpr (is_erasable)
      return start[i] + len[i];
    else
      return start[i + 1];
  }

  template <class Iter>
  struct RowBase
  {
    using iterator = Iter;
    using reference = typename iterator_traits<iterator>::reference;

  private:
    iterator begi, endi;

  public:
    RowBase(const iterator &begi, const iterator &endi) : begi(begi), endi(endi) {}
    inline iterator begin() const { return begi; }
    inline iterator end() const { return endi; }
    template <class I = ll>
    inline I size() const ;
    inline bool empty() const ;

    inline reference operator[](int i) const { return *(begi + i); }
    inline reference at(int i) const
    ;




    inline reference front() const
    {
      assert(!empty());
      return *begi;
    }
    inline reference back() const
    {
      assert(!empty());
      return *prev(endi);
    }

    vc<T> to_v() const ;
    vc<T> content() const ;
  };
  using Row = RowBase<typename vc<T>::iterator>;
  using ConstRow = RowBase<typename vc<T>::const_iterator>;

public:
  CSR() : n(0), m(0), start{0} {}

  template <class I = int>
  CSR(const vc<I> &row_sizes)
      : n(row_sizes.size())
  {
    static_assert(is_integral_ext<I>);
    start.resize(n + 1);
    for (int i = 0; i < n; i++)
    {
      if constexpr (is_signed_ext<I>) assert(row_sizes[i] >= 0);
      start[i + 1] = start[i] + int(row_sizes[i]);
    }
    m = start.back();
    elist.resize(m);
    if constexpr (is_erasable)
      len.assign(ALL(row_sizes));
  }

  template <class I>
  CSR(int n, const vc<pair<I, T>> &ies) : n(n), m(ies.size()), start(n, 0), elist(m)
  {
    if constexpr (is_erasable)
      len.resize(n);
    fec([ i, e ] : ies)
    {
      assert(0 <= i && i < n);
      start[i]++;
    }
    start = cumlsum(start);
    if constexpr (is_erasable)
      repi(i, n) len[i] = start[i + 1] - start[i];
    auto cnt = start;
    repi(j, m)
    {
      cauto & [ i, e ] = ies[j];
      int &k = cnt[i];
      elist[k] = e;
      k++;
    }
  }

  template <class U = T>
  CSR(const vvc<U> &vv) : n(vv.size()), start(n + 1, 0)
  {
    m = 0;
    fec(row : vv) m += row.size();
    elist.resize(m);
    if constexpr (is_erasable)
      len.resize(n);
    for (int i = 0, j = 0; i < n; i++)
    {
      start[i] = j;
      if constexpr (is_erasable)
        len[i] = vv[i].size();
      fec(e : vv[i])
      {
        elist[j] = e;
        j++;
      }
    }
    start.back() = m;
  }

  template <class U, bool erasable>
  explicit CSR(const CSR<U, erasable> &other)
      : CSR(gen_vec(other.template size<int>(), [&](int i) { return other[i].template size<int>(); }))
  {
    for (int i = 0; i < n; i++) copy(ALL(other[i]), elist.begin() + start[i]);
  }

  Row operator[](int i) { return Row(elist.begin() + start[i], elist.begin() + get_last(i)); }
  ConstRow operator[](int i) const
  ;
  Row at(int i)
  ;




  ConstRow at(int i) const
  ;





  void pop_back(int i)
  ;






  int offset(int i) const
  ;





  void sortunique()
  ;
#line 5446
  template <class I = ll>
  I size() const ;

  vvc<T> to_vv() const
  ;




  vvc<T> content() const ;

  vc<T> &get_elist() ;
  const vc<T> &get_elist() const ;
};

template <class T>
CSR(const vvc<T> &) -> CSR<T>;




namespace internal
{

template <class S, class Rows>
pair<int, S> row_reduction_mod32(Rows &a, int n, int m, bool rref)
;
#line 5535
}



#include <cassert>
#include <cstddef>
#include <cstdint>
#include <optional>
#include <type_traits>
#include <utility>
#include <vector>


namespace internal { namespace matrix_power_mod32_detail {

template <class T>
inline constexpr bool supported_builtin_exponent_v =
    std::is_integral_v<T>

    || std::is_same_v<T, __int128> || std::is_same_v<T, unsigned __int128>

    ;

template <class S>
using Matrix = std::vector<std::vector<S>>;

template <class S>
Matrix<S> identity(std::size_t n) ;





template <class S>
void require_square(const Matrix<S>& a) ;



template <class S>
Matrix<S> multiply(const Matrix<S>& a, const Matrix<S>& b) ;
#line 5591
template <class S, class T>
Matrix<S> power_over_ring(const Matrix<S>& a, T exponent) ;
#line 5605
template <class T>
std::size_t binary_multiplication_count(T exponent) ;









template <class S, class T>
S scalar_power(S a, T exponent) ;









template <class S, class T>
Matrix<S> power_weighted_map(std::vector<std::size_t> next,
                             std::vector<S> weight, T exponent,
                             bool transposed) ;
#line 5660
template <class S, class T>
std::optional<Matrix<S>> rank_one_power(const Matrix<S>& a, T exponent) ;
#line 5697
template <class S>
std::optional<Matrix<S>> invert(const Matrix<S>& a) ;
#line 5733
template <class S>
std::vector<S> apply_vector(const Matrix<S>& a, const std::vector<S>& v) ;










template <class S>
std::vector<S> polynomial_multiply(const std::vector<S>& a,
                                   const std::vector<S>& b,
                                   const std::vector<S>& recurrence) ;
#line 5766
template <class S, class T>
std::vector<S> polynomial_power(T exponent,
                               const std::vector<S>& recurrence) ;
#line 5782
template <class S, class T>
std::optional<Matrix<S>> try_cyclic_power(const Matrix<S>& a, T exponent) ;
#line 5815
template <class S>
std::vector<S> characteristic_recurrence(Matrix<S> h) ;
#line 5861
inline std::size_t evaluation_block_size(std::size_t n) {
    std::size_t s = 1;
    while (s * s < n) ++s;
    return s;
}


template <class S>
Matrix<S> evaluate_polynomial(const Matrix<S>& a,
                              const std::vector<S>& coefficient) ;
#line 5896
template <class S, class T>
Matrix<S> power_over_field(const Matrix<S>& a, T exponent) ;
#line 5955
template <class S>
bool is_prime_modulus() ;
#line 5970
} }




namespace internal
{
template <class F, int BS, class A, class B, class C>
void matrix_product(int n, int m, int p, const A &a, const B &b, C &c)
{
  using S = typename F::S;
  const S zero = F::e0();
  if (n == m && m == p && n <= 8)
  {
    bool upper = true;
    for (int i = 1; i < n && upper; ++i)
      for (int j = 0; j < i; ++j)
        if (a[i][j] != zero || b[i][j] != zero)
        {
          upper = false;
          break;
        }
    if (upper)
    {
      for (int i = 0; i < n; ++i)
        for (int k = i; k < m; ++k)
        {
          S x = a[i][k];
          if (x == zero)
            continue;
          for (int j = k; j < p; ++j)
            c[i][j] = F::add(c[i][j], F::mul(x, b[k][j]));
        }
      return;
    }
  }
  if (n >= 16 && m >= 16 && p >= 16)
  {
    ll left = 0, right = 0;
    for (int i = 0; i < n; ++i)
      for (int k = 0; k < m; ++k)
        left += a[i][k] != zero;
    if (!left)
      return;
    vc<int> sizes(m);
    for (int k = 0; k < m; ++k)
      for (int j = 0; j < p; ++j)
        if (b[k][j] != zero)
        {
          ++sizes[k];
          ++right;
        }
    if (!right)
      return;
    if (right * 4 <= ll(m) * p)
    {
      CSR<pair<int, S>> rows(sizes);
      for (int k = 0; k < m; ++k)
      {
        int at = 0;
        for (int j = 0; j < p; ++j)
          if (b[k][j] != zero)
            rows[k][at++] = {j, b[k][j]};
      }
      for (int i = 0; i < n; ++i)
        for (int k = 0; k < m; ++k)
        {
          S x = a[i][k];
          if (x == zero)
            continue;
          for (const auto &[j, y] : rows[k])
            c[i][j] = F::add(c[i][j], F::mul(x, y));
        }
      return;
    }
    if constexpr (dot_product_mod32<F>::value)
    {
      if (left * 2 >= ll(n) * m)
      {
        vc<S> bt(size_t(p) * m);
        for (int k = 0; k < m; ++k)
          for (int j = 0; j < p; ++j)
            bt[size_t(j) * m + k] = b[k][j];
        for (int i = 0; i < n; ++i)
          for (int j = 0; j < p; ++j)
            c[i][j] = dot_product<F>(m, a[i].begin(), bt.begin() + size_t(j) * m);
        return;
      }
    }
    if (left * 4 <= ll(n) * m)
    {
      for (int i = 0; i < n; ++i)
        for (int k = 0; k < m; ++k)
        {
          S x = a[i][k];
          if (x == zero)
            continue;
          for (int j = 0; j < p; ++j)
            c[i][j] = F::add(c[i][j], F::mul(x, b[k][j]));
        }
      return;
    }
  }
  for (int ii = 0; ii < n; ii += BS)
    for (int kk = 0; kk < m; kk += BS)
      for (int jj = 0; jj < p; jj += BS)
        for (int i = ii; i < min(ii + BS, n); ++i)
          for (int k = kk; k < min(kk + BS, m); ++k)
          {
            S x = a[i][k];
            if (x == zero)
              continue;
            for (int j = jj; j < min(jj + BS, p); ++j)
              c[i][j] = F::add(c[i][j], F::mul(x, b[k][j]));
          }
}
}








template <class F, int n, int m, int BS = 32>
struct MatrixArray : array<array<typename F::S, m>, n>
{
  using S = typename F::S;
  using M = MatrixArray;
  using Vn = array<S, n>;
  using Vm = array<S, m>;
  using Base = array<array<S, m>, n>;
  using Base::at;
  template<class I=ll> static constexpr pair<I,I> shape() ;
  S &operator()(int i,int j) ;
  const S &operator()(int i,int j) const ;
  S &at(int i,int j) ;
  const S &at(int i,int j) const ;
  auto &row(int i) ;
  const auto &row(int i) const ;

  MatrixArray(const S &diag = F::e0(), const S &non_diag = F::e0())
  {
    repi(i, n) repi(j, m)(*this)[i][j] = i == j ? diag : non_diag;
  }
  MatrixArray(const array<array<S, m>, n> &a)
  { repi(i, n) repi(j, m) (*this)[i][j] = a[i][j]; }


  MatrixArray<F, m, n, BS> transpose() const
  ;





  static constexpr MatrixArray e0() ;
  static constexpr MatrixArray e1() { return MatrixArray(F::e1(), F::e0()); }

  M operator-() const
  ;




  M &operator+=(const M &b)
  ;



  M &operator-=(const M &b)
  ;



  M &operator*=(const S &x)
  ;



  M &operator/=(const S &x) ;
  Vn operator*(const Vm &v) const
  {
    Vn res;
    fill(ALL(res), F::e0());
    repi(i, n) res[i] = dot_product<F>(m, (*this)[i].begin(), v.begin());
    return res;
  }
  friend Vm operator*(const Vn &v, const M &a)
  {
    Vm res;
    fill(ALL(res), F::e0());
    repi(i, n) repi(j, m) res[j] = F::add(res[j], F::mul(v[i], a[i][j]));
    return res;
  }
  template <int p>
  MatrixArray<F, n, p> operator*(const MatrixArray<F, m, p> &b) const
  {
    MatrixArray<F, n, p> res;
    repi(i, n) repi(j, p) res[i][j] = F::e0();
    internal::matrix_product<F, BS>(n, m, p, *this, b, res);
    return res;
  }
  template <class T = ll>
  M pow(T k) const
  ;
#line 6204
  M operator+(const M &a) const ;
  M operator-(const M &a) const ;
  M operator*(const S &x) const ;
  M operator/(const S &x) const { return M(*this) /= x; }
  M &operator*=(const M &a) ;







  template <class I = ll>
  tuple<M, I, S> row_reduction(bool rref = false) const
  ;
#line 6274
  template <class I = ll>
  I rank() const ;


  S det() const
  ;







  optional<M> inv() const
  ;
#line 6302
  optional<pair<Vm, vc<Vm>>> solve(const Vn &b) const
  ;
#line 6335
};


using Mat = MatrixArray<FieldAddSubMulDiv<mint>, 3, 3>;
const Mat M0 = {{{
  {1, 1, 0},
  {0, 1, 0},
  {0, 0, 1}
}}};
const Mat M1 = {{{
  {1, 0, 0},
  {1, 1, 1},
  {0, 0, 1}
}}};

void main2()
{
  LL(N, Q);
  STR(S);
  auto A = stov(S, '0');

  vc<Mat> vec(N);
  rep(i, N) vec[i] = S[i] == '0' ? M0 : M1;

  set<ll> st;
  rep(i, N) st.insert(i);

  RangeAssignSegmentTree<OppositeMonoid<MonoidMul<Mat>>> seg(vec);
  rep(_, Q)
  {
    LL(t, l, r);
    l--;
    if (t == 1)
    {
      seg.set(l, r, Mat::e1());
    }
    else if (t == 2)
    {
      auto res = seg.prod_apply(l, r, array<mint, 3>{0, 0, 1}, [&](auto &x, auto &m)
                                { return m * x; });
      // dump(res);
      PRINT(res[0] + res[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();
#line 6439
    CERR("\n[SINGLE_TESTCASE]\n\n", "36");
    main2();
#line 6454
  }
};

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


// submit-code: hash=a25327f63a3c source=a25327f63a3cbc5806be8e10f17e389a9a3d7ef1a90e76fdac34d9fa38808c0f input=144620448a6f154792aed3d95a6ccfe88fec9c6f9a4db147c8a140a8f3ea13b3 body=813e93232ac799d8b2a04315fdd860b1b8de1861ac9d1d1c00bc17633ac4906a
0