#1184126 (C++23) No.3670 Fast Knapsack

• 問題: No.3670 Fast Knapsack
• ユーザー: miscalc
• 提出日時: 2026-09-05 19:22:04
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 393 ms / 2,500 ms
• コード長: 46,809 bytes
• コンパイル時間: 3,168 ms
• コンパイル使用メモリ: 370,564 KB
• 実行使用メモリ: 7,556 KB
• 最終ジャッジ日時: 2026-09-05 19:22:12
• 合計ジャッジ時間: 7,925 ms
• ジャッジサーバーID （参考情報）: judge4_1 / judge2_0

ファイルパターン	結果
sample	AC * 1
other	AC * 25

ソースコード

#define INF 4'000'000'000'000'000'037LL

// https://github.com/miscalculation53/library/tree/wip/template/template_all.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_all_but_modint.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_types.hpp

#include <bits/stdc++.h>
namespace {
using namespace std;

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

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

using i128 = __int128_t;
using u128 = __uint128_t;

#define cauto const auto
// https://github.com/miscalculation53/library/tree/wip/template/template_rep.hpp

#define overload4(_1,_2,_3,_4,name,...) name
#define repi1(i,n) for (int i = 0, nnnnn = int(n); i < nnnnn; i++)
#define repi2(i,l,r) for (int i = int(l), rrrrr = int(r); i < rrrrr; i++)
#define repi3(i,l,r,d) for (int i = int(l), rrrrr = int(r), ddddd = int(d); ddddd > 0 ? i < rrrrr : i > rrrrr; i += d)
#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)

#define fec(...) for (cauto &__VA_ARGS__)
#define fem(...) for (auto &__VA_ARGS__)
// https://github.com/miscalculation53/library/tree/wip/template/template_math.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/is_integral_ext.hpp

template <class T>
constexpr bool is_integral_ext = is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>;

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

template <class T>
constexpr bool is_unsigned_ext = is_unsigned_v<T> || is_same_v<T, u128>;

template <class T, class U>
inline bool chmin(T &a, U b) { return a > b ? a = b, true : false; }

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) { return T(a) / T(b) - (T(a) % T(b) && (T(a) ^ T(b)) < 0); }
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T divround(U a, V b) { return divfloor<T>(2 * T(a) + T(b), 2 * T(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) { return T(a) - T(b) * divfloor<T>(a, b); }

template <class T = ll, class U, class V>
constexpr T ipow(U a, V b)
{
  assert(b >= 0);
  if (b == 0)
    return 1;
  if (a == 0 || a == 1)
    return a;
  if (a < 0 && a == -1)
    return b & 1 ? -1 : 1;

  T res = 1, tmp = a;
  while (true)
  {
    if (b & 1)
      res *= tmp;
    b >>= 1;
    if (b == 0)
      break;
    tmp *= tmp;
  }
  return res;
}
template <class T = ll, class A, class B, class M>
T mul_limited(A a, B b, M m)
{
  assert(a >= 0 && b >= 0 && m >= 0);
  if (b == 0)
    return 0;
  return T(a) > T(m) / T(b) ? T(m) : T(a) * T(b);
}
template <class T = ll, class A, class B>
T mul_limited(A a, B b) { return mul_limited<T>(a, b, INF); }
template <class T = ll, class A, class B, class M>
T pow_limited(A a, B b, M m)
{
  assert(a >= 0 && b >= 0 && m >= 0);
  if (a <= 1 || b == 0)
    return min(ipow<T>(a, b), T(m));
  
  T res = 1, tmp = a;
  while (true)
  {
    if (b & 1)
    {
      if (res > T(m) / tmp)
        return m;
      res *= tmp;
    }
    b >>= 1;
    if (b == 0)
      break;
    if (tmp > T(m) / tmp)
      return m;
    tmp *= tmp;
  }
  return res;
}
template <class T = ll, class A, class B>
T pow_limited(A a, B b) { return pow_limited<T>(a, b, INF); }

template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base, int n)
{
  assert(val >= 0);
  assert(base >= 2);
  assert(n >= 0);
  vc<T> a(n);
  repi(i, n)
  {
    a[i] = val % base;
    val /= base;
  }
  reverse(a.begin(), a.end());
  return a;
}
// https://github.com/miscalculation53/library/tree/wip/template/template_vector.hpp

#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

template <class T, size_t d, size_t i = 0, class V>
auto dvec(const V (&sz)[d], const T &init)
{
  if constexpr (i < d)
    return vc(sz[i], dvec<T, d, i + 1>(sz, init));
  else
    return init;
}

// https://github.com/miscalculation53/library/tree/wip/template/template_algo.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/resolved_value.hpp

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

template <class T, class U>
vc<T> permuted(const vc<T> &a, const vc<U> &p)
{
  const int n = p.size();
  vc<T> res(n);
  repi(i, n)
  {
    assert(0 <= p[i] && p[i] < U(a.size()));
    res[i] = a[p[i]];
  }
  return res;
}

template <class T, class U, class... Ts>
vc<T> permuted(const vc<T> &p, const vc<U> &q, const vc<Ts> &...rs)
{
  return permuted(permuted(p, q), rs...);
}

template <class V, class Equal = equal_to<>>
void unique(V &v, Equal equal = {}) { v.erase(std::unique(ALL(v), equal), v.end()); }

template <class V, class U>
void rotate(V &v, U k)
{ 
  const U n = v.size();
  if (n == 0)
    return;
  k = (k % n + n) % n;
  std::rotate(v.begin(), v.begin() + k, v.end());
}

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

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;

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
  {
  };
}

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}}};
// https://github.com/miscalculation53/library/tree/wip/template/template_binsearch.hpp

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;

namespace internal
{
};

// https://github.com/miscalculation53/library/tree/wip/template/template_bit.hpp

template <class T>
inline constexpr ull MASK(T k) { return (1ULL << k) - 1ULL; }

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

// https://github.com/miscalculation53/library/tree/wip/template/template_inout.hpp

// https://github.com/miscalculation53/library/tree/wip/template/template_dump.hpp

#define dump(...) 
#define local(...) 
#define oj(...) __VA_ARGS__

template <class T, class Sequence>
vc<T> content(queue<T, Sequence> que)
{
  vc<T> res;
  while (!que.empty())
  {
    res.eb(que.front());
    que.pop();
  }
  return res;
}
template <class T, class Sequence, class Compare>
vc<T> content(priority_queue<T, Sequence, Compare> pque)
{
  vc<T> res;
  while (!pque.empty())
  {
    res.eb(pque.top());
    pque.pop();
  }
  return res;
}
template <class T>
auto content(const T &obj) { return obj.content(); }

namespace fastio {
template <class T>
struct unsigned_integer
{
  using type = make_unsigned_t<T>;
};
template <>
struct unsigned_integer<i128>
{
  using type = u128;
};
template <>
struct unsigned_integer<u128>
{
  using type = u128;
};
template <class T>
using unsigned_integer_t = typename unsigned_integer<T>::type;

static constexpr uint32_t SIZ = 1 << 17;
char ibuf[SIZ];
char obuf[SIZ];
char out[100];

uint32_t pil = 0, pir = 0, por = 0;

struct Pre {
  char num[10000][4];
  constexpr Pre() : num() {
    for (int i = 0; i < 10000; i++) {
      int n = i;
      for (int j = 3; j >= 0; j--) {
        num[i][j] = n % 10 | '0';
        n /= 10;
      }
    }
  }
} constexpr pre;

inline void load() {
  memcpy(ibuf, ibuf + pil, pir - pil);
  pir = pir - pil + fread(ibuf + pir - pil, 1, SIZ - pir + pil, stdin);
  pil = 0;
  if (pir < SIZ) ibuf[pir++] = '\n';
}

inline void flush() {
  fwrite(obuf, 1, por, stdout);
  por = 0;
}

template <bool check_buffer = true, typename T>
void rd1_integer(T &x) {
  using U = unsigned_integer_t<T>;
  bool minus = false;
  U val = 0;
  if constexpr (check_buffer)
    if (pil + 100 > pir) load();
  uint32_t p = pil;
  while (ibuf[p] < '-') ++p;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
    if (ibuf[p] == '-') minus = true, ++p;
  }
  while ('0' <= ibuf[p]) val = val * 10 + (ibuf[p++] & 15);
  pil = p;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>)
  {
    if (minus)
    {
      const U min_abs = U(numeric_limits<T>::max()) + 1;
      x = val == min_abs ? numeric_limits<T>::lowest() : -T(val);
    }
    else x = T(val);
  }
  else
    x = T(val);
}

void rd1(ll &x) { rd1_integer(x); }

template <class T, class U>
void rd1(pair<T, U> &p) {
  return rd1(p.first), rd1(p.second);
}
template <class... T>
void rd1(tuple<T...> &tpl) {
  apply([](auto &...x) { (rd1(x), ...); }, tpl);
}

template <size_t N = 0, typename T>
void rd1(array<T, N> &x) {
  for (auto &d: x) rd1(d);
}
template <class T>
void rd1(vc<T> &x) {
  for (auto &d: x) rd1(d);
}

template <class... T>
void read(T &...x) {
  if constexpr (sizeof...(T) <= SIZ / 100 &&
                ((!is_same_v<T, char> &&
                  (is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>)) && ...)) {
    if (pil + 100 * sizeof...(T) > pir) load();
    (rd1_integer<false>(x), ...);
  }
  else
    (rd1(x), ...);
}

void wt1(const char c) {
  if (por == SIZ) flush();
  obuf[por++] = c;
}

template <typename T>
void wt1_integer(T x) {
  if (por > SIZ - 100) flush();
  using U = unsigned_integer_t<T>;
  U ux;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>)
  {
    if (x < 0)
      obuf[por++] = '-', ux = U(0) - U(x);
    else
      ux = U(x);
  }
  else
    ux = x;
  int outi;
  for (outi = 96; ux >= 10000; outi -= 4) {
    memcpy(out + outi, pre.num[ux % 10000], 4);
    ux /= 10000;
  }
  if (ux >= 1000) {
    memcpy(obuf + por, pre.num[ux], 4);
    por += 4;
  } else if (ux >= 100) {
    memcpy(obuf + por, pre.num[ux] + 1, 3);
    por += 3;
  } else if (ux >= 10) {
    int q = (ux * 103) >> 10;
    obuf[por] = q | '0';
    obuf[por + 1] = (ux - q * 10) | '0';
    por += 2;
  } else
    obuf[por++] = ux | '0';
  memcpy(obuf + por, out + outi + 4, 96 - outi);
  por += 96 - outi;
}

void wt1(int x) { wt1_integer(x); }
template <class T, enable_if_t<is_integral_v<T>, int> = 0>
void wt1(T x) { wt1_integer(x); }

template <class T, class U>
void wt1(const pair<T, U> &val) {
  wt1(val.first);
  wt1(' ');
  wt1(val.second);
}
template <class... T>
void wt1(const tuple<T...> &tpl) {
  if constexpr (sizeof...(T))
  {
    int i = 0;
    apply([&](const auto &...x)
          { ((i++ ? wt1(' ') : void(), wt1(x)), ...); }, tpl);
  }
}
template <class T, size_t S>
void wt1(const array<T, S> &val) {
  auto n = val.size();
  for (size_t i = 0; i < n; i++) {
    if (i) wt1(' ');
    wt1(val[i]);
  }
}
template <class T>
void wt1(const vector<T> &val) {
  auto n = val.size();
  for (size_t i = 0; i < n; i++) {
    if (i) wt1(' ');
    wt1(val[i]);
  }
}

template <class... T>
void write(T &&...x) {
  (wt1(std::forward<T>(x)), ...);
}

template <class... T>
void print(T &&...x) {
  if constexpr (sizeof...(T))
  {
    int i = 0;
    ((i++ ? wt1(' ') : void(), wt1(std::forward<T>(x))), ...);
  }
  wt1('\n');
}

} 

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

namespace internal
{

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

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

}; 

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

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

#define LL(...) IN(ll, __VA_ARGS__)

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

#define VEC(T,n,...) vc<T> __VA_ARGS__; READVEC(n, __VA_ARGS__)

#define PRINT fastio::print

template <class T, class U, class P>
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>
pair<T, U> operator+(pair<T, U> a, const P &b) { return a += b; }
template <class T, class U, class P>
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>
pair<T, U> operator-(pair<T, U> a, const P &b) { return a -= b; }
template <class T, class U>
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>
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>
array<T, n> operator+(array<T, n> a, const A &b) { return a += b; }
template <class T, size_t n, class A>
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>
array<T, n> operator-(array<T, n> a, const A &b) { return a -= b; }
template <class T, size_t n>
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>
auto &tuple_add_impl(A &a, const B &b, const index_sequence<I...>)
{
  ((get<I>(a) += get<I>(b)), ...);
  return a;
}
template <size_t... I, class A, class B>
auto &tuple_sub_impl(A &a, const B &b, const index_sequence<I...>)
{
  ((get<I>(a) -= get<I>(b)), ...);
  return a;
}
template <size_t... I, class A>
auto &tuple_neg_impl(A &a, const index_sequence<I...>)
{
  ((get<I>(a) = -get<I>(a)), ...);
  return a;
}

}; 

template <class... Ts, class Tp>
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>
tuple<Ts...> operator+(tuple<Ts...> a, const Tp &b) { return a += b; }
template <class... Ts, class Tp>
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>
tuple<Ts...> operator-(tuple<Ts...> a, const Tp &b) { return a -= b; }
template <class... Ts>
tuple<Ts...> operator-(tuple<Ts...> a)
{
  internal::tuple_neg_impl(a, make_index_sequence<sizeof...(Ts)>{});
  return a;
}

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)
{ ((get<I>(tv)[index] = get<I>(t)), ...); }

template <size_t... I, class Tp>
auto tv_to_vt_impl(const Tp &tv, index_sequence<I...>, size_t index)
{ return make_tuple(get<I>(tv)[index]...); }

};

// https://github.com/miscalculation53/library/tree/wip/template/template_random.hpp

mt19937_64 mt;

namespace internal
{
}; 

// https://github.com/miscalculation53/library/tree/wip/math/modint/template_modint.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/modint.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_static.hpp

// https://github.com/miscalculation53/library/tree/wip/utils/larger_int.hpp

template <class T>
struct larger_int
{
  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>
using larger_int_t = typename larger_int<T>::type;
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_isprime.hpp

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 = larger_int_t<value_type>;

  static constexpr bool is_prime = isprime_constexpr(M);

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

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

};
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_barrett32.hpp

namespace internal
{

struct barrett32
{
  uint m;
  ull im;
  explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}
  uint umod() const { return m; }
  uint mul(uint a, uint b) const
  {
    ull z = a;
    z *= b;
    ull x = ull((u128(z) * im) >> 64);
    ull y = x * m;
    return uint(z - y + (z < y ? m : 0));
  }
};

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{998244353};
  static void set_mod(mod_type m) { reducer = barrett32(m); }
  static mod_type mod() { return reducer.umod(); }
  static value_type umod() { return reducer.umod(); }
  static value_type init(value_type v) { return v; }
  static mod_type val(value_type v) { return v; }
  static value_type mul(value_type a, value_type b) { return reducer.mul(a, b); }
};

};
// https://github.com/miscalculation53/library/tree/wip/math/modint/modint_internal_montgomery64.hpp

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, im, sq;
  explicit montgomery64odd(ull m) : m(m), im(inv64(m)), sq(-u128(m) % m) {}
  ull umod() const { return m; }
  ull reduce(u128 x) const
  {
    auto t = (x + u128(m) * (-im * ull(x))) >> 64;
    if (t >= m) t -= m;
    return (ull)t;
  }
  ull inv_reduce(i128 v) const { return reduce(u128(v % m + m) * sq); }
};

struct montgomery64
{
  ull m, mx, imx, d, q;
  uint b;
  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 { return m; }
  ull reduce(u128 x) const
  {
    if (b == 0)
    {
      auto t = (x + u128(mx) * (-imx * ull(x))) >> 64;
      if (t >= m) t -= m;
      return (ull)t;
    }
    ull p = x & MASK(b); 
    x = (x >> b) + p * d;
    ull y = p << (64 - b);
    auto t = (x + u128(mx) * (imx * (y - ull(x)))) >> (64 - b);
    if (t >= m) { t -= m; if (t >= m) t -= m; }
    return (ull)t;
  }
  ull inv_reduce(i128 v) const { return reduce(u128(v % m + m) * q); }
};

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{(1LL << 61) - 1};
  static void set_mod(mod_type m) { reducer = montgomery64odd(m); }
  static mod_type mod() { return reducer.umod(); }
  static value_type umod() { return reducer.umod(); }
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v) { return reducer.reduce(v); }
  static value_type mul(value_type a, value_type b) { return reducer.reduce((calc_type)a * 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{(1LL << 61) - 1};
  static void set_mod(mod_type m) { reducer = montgomery64(m); }
  static mod_type mod() { return reducer.umod(); }
  static value_type umod() { return reducer.umod(); }
  static value_type init(value_type v) { return reducer.inv_reduce(v); }
  static mod_type val(value_type v) { return reducer.reduce(v); }
  static value_type mul(value_type a, value_type b) { return reducer.reduce((calc_type)a * b); }
};

};
// https://github.com/miscalculation53/library/tree/wip/math/extgcd.hpp

template <class T = ll>
constexpr tuple<T, T, T> extgcd(T a, T b)
{
  if (a == 0 && b == 0)
    return {0, 0, 0};
  
  T x1 = 1, y1 = 0, z1 = a;
  T x2 = 0, y2 = 1, z2 = b;
  while (z2 != 0)
  {
    
    T q = z1 / z2;
    tie(x1, x2) = make_pair(x2, x1 - q * x2);
    tie(y1, y2) = make_pair(y2, y1 - q * y2);
    tie(z1, z2) = make_pair(z2, z1 - q * z2);
  }
  if (z1 < 0)
    x1 = -x1, y1 = -y1, z1 = -z1;
  return {z1, x1, y1};
}

namespace internal
{

  template <class Policy>
  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() { return Policy::mod(); }

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

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

    modint_impl() : _v(0) {}

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

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

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

    mint &operator++()
    {
      _v++;
      if (_v == Policy::umod())
        _v = 0;
      return *this;
    }
    mint &operator--()
    {
      if (_v == 0)
        _v = Policy::umod();
      _v--;
      return *this;
    }
    mint operator++(int)
    {
      mint res = *this;
      ++(*this);
      return res;
    }
    mint operator--(int)
    {
      mint res = *this;
      --(*this);
      return res;
    }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }

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

    friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }
  
    friend 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>;

template <class T>
struct is_modint : std::false_type
{
};
template <class Policy>
struct is_modint<internal::modint_impl<Policy>> : 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>
struct is_static_modint<static_modint32<m>> : true_type {};
template <ll m>
struct is_static_modint<static_modint64<m>> : 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
{
};

// https://github.com/miscalculation53/library/tree/wip/math/modint/power_table.hpp

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

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

  void reserve(int n)
  {
    if (mod != mint::mod())
    {
      mod = mint::mod();
      pw = {1};
    }
    int i = pw.size();
    if (n < i)
      return;
    pw.resize(n + 1);
    for (; i <= n; i++)
      pw[i] = pw[i - 1] * base;
  }

  mint pow(int n)
  {
    reserve(n);
    return pw[n];
  }
};
// https://github.com/miscalculation53/library/tree/wip/math/modint/binomial.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/stom.hpp

// https://github.com/miscalculation53/library/tree/wip/math/modint/to_rational.hpp

// https://github.com/miscalculation53/library/tree/wip/math/svp2d.hpp

template <class T = ll, class U = larger_int_t<T>>
pair<T, T> svp2d(const pair<T, T> &a, const pair<T, T> &b)
{
  assert((a != pair<T, T>{0, 0} && b != pair<T, T>{0, 0}));
  auto [a1, a2] = a;
  auto [b1, b2] = b;
  if ((U)a1 * a1 + (U)a2 * a2 < (U)b1 * b1 + (U)b2 * b2)
    swap(a1, b1), swap(a2, b2);
  while ((U)a1 * a1 + (U)a2 * a2 > (U)b1 * b1 + (U)b2 * b2)
  {
    swap(a1, b1), swap(a2, b2);
    T k = divround<U>((U)a1 * b1 + (U)a2 * b2, (U)a1 * a1 + (U)a2 * a2);
    b1 -= k * a1, b2 -= k * a2;
    if (b1 == 0 && b2 == 0)
      return {a1, a2};
  }
  return {a1, a2};
}

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
{
  struct mint_to_rat_fn
  {
    template <class T>
    constexpr auto operator()(const T &x) const -> decltype(mint_to_rat(x))
    {
      return mint_to_rat(x);
    }
  };

  struct rat_closure : std::ranges::range_adaptor_closure<rat_closure>
  {
    template <typename T>
    constexpr auto operator()(T &&t) const
    {
      if constexpr (!std::ranges::range<T> && std::invocable<mint_to_rat_fn, decltype(std::forward<T>(t))>)
      {
        return mint_to_rat_fn{}(std::forward<T>(t));
      }
      else if constexpr (std::ranges::range<T>)
      {
        using Ref = std::ranges::range_reference_t<T>;

        if constexpr (std::invocable<mint_to_rat_fn, decltype(std::forward<Ref>(std::declval<Ref>()))>)
        {
          return std::forward<T>(t) | std::views::transform(mint_to_rat_fn{});
        }
        else if constexpr (std::ranges::range<Ref>)
        {
          return std::forward<T>(t) | std::views::transform([this](auto &&inner)
                                                            { return (*this)(std::forward<decltype(inner)>(inner)); });
        }
        else
        {
          static_assert(false);
        }
      }
      else
      {
        static_assert(false);
      }
    }
  };

  template <typename T>
    requires(!std::ranges::range<T> && std::invocable<mint_to_rat_fn, T>)
  constexpr auto operator|(T &&t, const rat_closure &c)
  {
    return c(std::forward<T>(t));
  }

}

using mint = modint998244353;

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

// https://github.com/miscalculation53/library/tree/wip/algo/subset_sum.hpp

// https://github.com/miscalculation53/library/tree/wip/ds/dynamic_bitset.hpp

struct DynamicBitset
{
  using Word = ull;
  static constexpr int word_bits = numeric_limits<Word>::digits;

private:
  int n;
  vc<Word> dat;

  static int word_size(int n) { return (n + word_bits - 1) / word_bits; }
  static Word low_mask(int k)
  {
    return k == word_bits ? ~Word(0) : (Word(1) << k) - 1;
  }
  Word last_mask() const
  {
    return n % word_bits == 0 ? ~Word(0) : low_mask(n % word_bits);
  }
  void trim()
  {
    if (!dat.empty())
      dat.back() &= last_mask();
  }

  Word get_word(int i) const
  {
    int w = i / word_bits, b = i % word_bits;
    Word x = dat[w] >> b;
    if (b && w + 1 < SZ(dat))
      x |= dat[w + 1] << (word_bits - b);
    return x;
  }

  template <int op, class F>
  DynamicBitset &apply_slice(int l, int r, const DynamicBitset &b, int bl, const F &f)
  {
    assert(0 <= l && l <= r && r <= n);
    assert(0 <= bl && bl + r - l <= b.n);
    if (l == r)
      return *this;

    if constexpr (op == 2)
    {
      if (this == &b && bl == 0 && l > 0)
      {
        int dw = l / word_bits, db = l % word_bits;
        int lw = l / word_bits, rw = (r - 1) / word_bits;
        repi(w, rw, lw - 1, -1)
        {
          Word x = dat[w - dw] << db;
          if (db && w > dw)
            x |= dat[w - dw - 1] >> (word_bits - db);
          int lo = max(l, w * word_bits), hi = min(r, (w + 1) * word_bits);
          Word mask = low_mask(hi - lo) << (lo % word_bits);
          Word added = x & ~dat[w] & mask;
          dat[w] |= x & mask;
          if constexpr (!is_same_v<F, nullptr_t>)
          {
            while (added)
            {
              f(w * word_bits + __builtin_ctzll(added));
              added &= added - 1;
            }
          }
        }
        return *this;
      }
    }

    auto apply_word = [&](int w)
    {
      int lo = max(l, w * word_bits), hi = min(r, (w + 1) * word_bits);
      int len = hi - lo, shift = lo % word_bits;
      Word mask = low_mask(len) << shift;
      Word x = (b.get_word(bl + lo - l) & low_mask(len)) << shift;
      Word old = dat[w], y;
      if constexpr (op == 0)
        y = x;
      else if constexpr (op == 1)
        y = old & x;
      else if constexpr (op == 2)
        y = old | x;
      else
        y = old ^ x;
      dat[w] = (old & ~mask) | (y & mask);
      if constexpr (!is_same_v<F, nullptr_t>)
      {
        Word added = dat[w] & ~old & mask;
        while (added)
        {
          f(w * word_bits + __builtin_ctzll(added));
          added &= added - 1;
        }
      }
    };

    int lw = l / word_bits, rw = (r - 1) / word_bits;
    if (this == &b && bl < l && l < bl + r - l)
      repi(w, rw, lw - 1, -1) apply_word(w);
    else
      repi(w, lw, rw + 1) apply_word(w);
    return *this;
  }

public:
  struct Reference
  {
    DynamicBitset *bs;
    int pos;

    operator bool() const { return bs->test(pos); }
    Reference &operator=(bool value)
    {
      bs->set(pos, value);
      return *this;
    }
    Reference &operator=(const Reference &ref) { return *this = bool(ref); }
    Reference &flip()
    {
      bs->flip(pos);
      return *this;
    }
  };

  DynamicBitset() : n(0) {}
  
  DynamicBitset(int n, bool value = false) : n(n), dat(n < 0 ? 0 : word_size(n), value ? ~Word(0) : 0)
  {
    assert(n >= 0);
    trim();
  }
  
  explicit DynamicBitset(const string &s, char zero = '0', char one = '1') : n(0)
  {
    assign(s, zero, one);
  }

  int size() const { return n; }
  
  bool empty() const { return n == 0; }
  
  int capacity() const { return int(dat.capacity()) * word_bits; }

  void reserve(int n)
  {
    assert(n >= 0);
    dat.reserve(word_size(n));
  }

  void resize(int n, bool value = false)
  {
    assert(n >= 0);
    int old = this->n;
    dat.resize(word_size(n));
    this->n = n;
    if (value && old < n)
      set_range(old, n);
    trim();
  }

  DynamicBitset &assign(const string &s, char zero = '0', char one = '1')
  {
    assert(zero != one);
    assert(s.size() <= size_t(numeric_limits<int>::max()));
    n = int(s.size());
    dat.assign(word_size(n), 0);
    repi(i, n)
    {
      char c = s[n - 1 - i];
      assert(c == zero || c == one);
      if (c == one)
        dat[i / word_bits] |= Word(1) << (i % word_bits);
    }
    return *this;
  }

  bool test(int i) const
  {
    assert(0 <= i && i < n);
    return dat[i / word_bits] >> (i % word_bits) & 1;
  }
  bool operator[](int i) const { return test(i); }
  Reference operator[](int i)
  {
    assert(0 <= i && i < n);
    return {this, i};
  }

  DynamicBitset &set(int i, bool value = true)
  {
    assert(0 <= i && i < n);
    Word mask = Word(1) << (i % word_bits);
    if (value)
      dat[i / word_bits] |= mask;
    else
      dat[i / word_bits] &= ~mask;
    return *this;
  }
  
  DynamicBitset &reset(int i) { return set(i, false); }
  
  DynamicBitset &flip(int i)
  {
    assert(0 <= i && i < n);
    dat[i / word_bits] ^= Word(1) << (i % word_bits);
    return *this;
  }
  
  DynamicBitset &set()
  {
    fill(ALL(dat), ~Word(0));
    trim();
    return *this;
  }
  
  DynamicBitset &reset()
  {
    fill(ALL(dat), 0);
    return *this;
  }
  
  DynamicBitset &flip()
  {
    fem(x : dat) x = ~x;
    trim();
    return *this;
  }

  DynamicBitset &set_range(int l, int r, bool value = true)
  {
    assert(0 <= l && l <= r && r <= n);
    if (!value)
      return reset_range(l, r);
    if (l == r)
      return *this;
    int lw = l / word_bits, rw = (r - 1) / word_bits;
    if (lw == rw)
      dat[lw] |= low_mask((r - 1) % word_bits + 1) & ~low_mask(l % word_bits);
    else
    {
      dat[lw] |= ~low_mask(l % word_bits);
      fill(dat.begin() + lw + 1, dat.begin() + rw, ~Word(0));
      dat[rw] |= low_mask((r - 1) % word_bits + 1);
    }
    trim();
    return *this;
  }

  DynamicBitset &reset_range(int l, int r)
  {
    assert(0 <= l && l <= r && r <= n);
    if (l == r)
      return *this;
    int lw = l / word_bits, rw = (r - 1) / word_bits;
    if (lw == rw)
      dat[lw] &= ~(low_mask((r - 1) % word_bits + 1) & ~low_mask(l % word_bits));
    else
    {
      dat[lw] &= low_mask(l % word_bits);
      fill(dat.begin() + lw + 1, dat.begin() + rw, 0);
      dat[rw] &= ~low_mask((r - 1) % word_bits + 1);
    }
    return *this;
  }

  int count() const
  {
    int res = 0;
    fec(x : dat) res += __builtin_popcountll(x);
    return res;
  }

  int count(int l, int r) const
  {
    assert(0 <= l && l <= r && r <= n);
    if (l == r)
      return 0;
    int lw = l / word_bits, rw = (r - 1) / word_bits;
    if (lw == rw)
      return __builtin_popcountll(dat[lw] & low_mask((r - 1) % word_bits + 1) & ~low_mask(l % word_bits));
    int res = __builtin_popcountll(dat[lw] & ~low_mask(l % word_bits));
    repi(w, lw + 1, rw) res += __builtin_popcountll(dat[w]);
    return res + __builtin_popcountll(dat[rw] & low_mask((r - 1) % word_bits + 1));
  }

  bool any(int l, int r) const { return count(l, r) != 0; }
  
  bool all() const { return count() == n; }
  
  bool all(int l, int r) const { return count(l, r) == r - l; }

  int find_last(bool value = true) const { return find_prev(n, value); }
  
  int find_prev(int i, bool value = true) const
  {
    assert(0 <= i && i <= n);
    if (i == 0)
      return -1;
    i--;
    int w = i / word_bits, b = i % word_bits;
    Word x = (value ? dat[w] : ~dat[w]) & low_mask(b + 1);
    while (true)
    {
      if (x)
        return w * word_bits + 63 - __builtin_clzll(x);
      if (w-- == 0)
        return -1;
      x = value ? dat[w] : ~dat[w];
    }
  }

  DynamicBitset &operator&=(const DynamicBitset &b)
  {
    assert(n == b.n);
    repi(i, SZ(dat)) dat[i] &= b.dat[i];
    return *this;
  }
  DynamicBitset &operator|=(const DynamicBitset &b)
  {
    assert(n == b.n);
    repi(i, SZ(dat)) dat[i] |= b.dat[i];
    return *this;
  }
  DynamicBitset &operator^=(const DynamicBitset &b)
  {
    assert(n == b.n);
    repi(i, SZ(dat)) dat[i] ^= b.dat[i];
    return *this;
  }
  friend DynamicBitset operator&(DynamicBitset a, const DynamicBitset &b) { return a &= b; }
  friend DynamicBitset operator|(DynamicBitset a, const DynamicBitset &b) { return a |= b; }
  friend DynamicBitset operator^(DynamicBitset a, const DynamicBitset &b) { return a ^= b; }
  DynamicBitset operator~() const { return DynamicBitset(*this).flip(); }

  DynamicBitset &operator<<=(int k)
  {
    assert(k >= 0);
    if (k >= n)
      return reset();
    if (k == 0)
      return *this;
    int dw = k / word_bits, db = k % word_bits;
    repi(i, SZ(dat) - 1, dw - 1, -1)
    {
      Word x = dat[i - dw] << db;
      if (db && i > dw)
        x |= dat[i - dw - 1] >> (word_bits - db);
      dat[i] = x;
    }
    fill(dat.begin(), dat.begin() + dw, 0);
    trim();
    return *this;
  }

  DynamicBitset &operator>>=(int k)
  {
    assert(k >= 0);
    if (k >= n)
      return reset();
    if (k == 0)
      return *this;
    int dw = k / word_bits, db = k % word_bits, m = SZ(dat);
    repi(i, m - dw)
    {
      Word x = dat[i + dw] >> db;
      if (db && i + dw + 1 < m)
        x |= dat[i + dw + 1] << (word_bits - db);
      dat[i] = x;
    }
    fill(dat.end() - dw, dat.end(), 0);
    trim();
    return *this;
  }
  DynamicBitset operator<<(int k) const { return DynamicBitset(*this) <<= k; }
  DynamicBitset operator>>(int k) const { return DynamicBitset(*this) >>= k; }

  DynamicBitset &or_slice(int l, int r, const DynamicBitset &b, int bl)
  {
    return apply_slice<2>(l, r, b, bl, nullptr);
  }
  template <class F>
  DynamicBitset &or_slice(int l, int r, const DynamicBitset &b, int bl, const F &f)
  {
    return apply_slice<2>(l, r, b, bl, f);
  }

  friend bool operator==(const DynamicBitset &a, const DynamicBitset &b)
  {
    return a.n == b.n && a.dat == b.dat;
  }
  friend bool operator!=(const DynamicBitset &a, const DynamicBitset &b) { return !(a == b); }
  friend bool operator<(const DynamicBitset &a, const DynamicBitset &b)
  {
    assert(a.n == b.n);
    repi(i, SZ(a.dat) - 1, -1, -1)
      if (a.dat[i] != b.dat[i])
        return a.dat[i] < b.dat[i];
    return false;
  }
  friend bool operator>(const DynamicBitset &a, const DynamicBitset &b) { return b < a; }
  friend bool operator<=(const DynamicBitset &a, const DynamicBitset &b) { return !(b < a); }
  friend bool operator>=(const DynamicBitset &a, const DynamicBitset &b) { return !(a < b); }
};

struct SubsetSum;

struct SubsetSumFromFrequency
{
private:
  friend struct SubsetSum;

  int s;
  vc<pair<int, int>> val_cnt;
  DynamicBitset dp;
  vc<int> time;
  vc<DynamicBitset> history;
  bool keep_history;

  void build(const vc<pair<int, int>> &freq, int smax)
  {
    s = smax;
    assert(s >= 0);
    val_cnt.clear();
    history.clear();

    ll sm = 0;
    for (auto [v, c] : freq)
    {
      assert(v > 0 && c >= 0);
      if (v > s)
        continue;
      chmin(c, s / v);
      sm = min<ll>(s, sm + ll(v) * c);
    }
    s = int(sm);

    dp.resize(s + 1);
    dp.reset();
    dp.set(0);
    for (auto [v, c] : freq)
    {
      if (v > s)
        continue;
      chmin(c, s / v);
      for (ll k = 1; c > 0; k *= 2)
      {
        int x = int(min<ll>(c, k));
        c -= x;
        val_cnt.eb(v, x);
      }
    }

    ll bitset_bytes = ll((s + DynamicBitset::word_bits) / DynamicBitset::word_bits) * ll(sizeof(DynamicBitset::Word));
    keep_history = ll(val_cnt.size()) * bitset_bytes < ll(s + 1) * ll(sizeof(int));
    if (keep_history)
      history.reserve(val_cnt.size());
    else
    {
      time.assign(s + 1, -1);
      time[0] = 0;
    }

    int hi = 0;
    repi(t, SZ(val_cnt))
    {
      auto [v, c] = val_cnt[t];
      int w = v * c;
      int r = min(s, hi + w) + 1;
      if (keep_history)
      {
        dp.or_slice(w, r, dp, 0);
        history.eb(dp);
      }
      else
        dp.or_slice(w, r, dp, 0, [&](int i) { time[i] = t + 1; });
      hi = r - 1;
      if (hi == s && (t & 63) == 63 && dp.all())
      {
        val_cnt.resize(t + 1);
        if (keep_history)
          history.resize(t + 1);
        break;
      }
    }
  }

public:
  SubsetSumFromFrequency() : s(0), dp(1), time(1, 0), keep_history(false) { dp.set(0); }

  template <class T>
  SubsetSumFromFrequency(const vc<T> &freq, int smax)
  {
    static_assert(is_integral_ext<T>);
    assert(smax >= 0);
    vc<pair<int, int>> f;
    int vmax = min(smax, SZ<int>(freq) - 1);
    repi(v, 1, vmax + 1)
    {
      assert(freq[v] >= 0);
      int c = freq[v] < T(smax / v) ? int(freq[v]) : smax / v;
      if (c)
        f.eb(v, c);
    }
    build(f, smax);
  }

  bool exists(int x) const
  {
    return 0 <= x && x <= s && dp.test(x);
  }

  const DynamicBitset &reachable() const { return dp; }

  pair<bool, vc<pair<int, int>>> answer(int x) const
  {
    if (!exists(x))
      return {false, {}};

    vc<pair<int, int>> res;
    int y = x;
    repi(t, SZ(val_cnt) - 1, -1, -1)
    {
      auto [v, c] = val_cnt[t];
      int w = v * c;
      bool can = false;
      if (y >= w)
      {
        if (keep_history)
          can = t == 0 ? y == w : history[t - 1].test(y - w);
        else
          can = time[y - w] != -1 && time[y - w] <= t;
      }
      if (can)
      {
        y -= w;
        if (res.empty() || res.back().first != v)
          res.eb(v, 0);
        res.back().second += c;
      }
    }
    return {true, res};
  }
};

struct SubsetSum
{
private:
  int n, s, xmax;
  ll negsum;
  vc<bool> isneg;
  vc<pair<int, int>> elems;
  SubsetSumFromFrequency ss;

public:
  SubsetSum() : n(0), s(-1), xmax(-1), negsum(0) {}

  template <class T>
  SubsetSum(const vc<T> &a, int smax) : n(SZ<int>(a)), xmax(smax), negsum(0)
  {
    static_assert(is_integral_ext<T>);
    isneg.assign(n, false);
    repi(i, n) if (a[i] < 0)
    {
      isneg[i] = true;
      negsum += ll(a[i]);
    }
    ll shifted_s = ll(smax) - negsum;
    assert(shifted_s <= numeric_limits<int>::max());
    if (shifted_s < 0)
    {
      s = -1;
      return;
    }

    ll sm = 0;
    fec(a_i : a)
    {
      ll x = ll(a_i);
      if (x < 0) x = -x;
      if (x <= shifted_s)
        sm = min(shifted_s, sm + x);
    }
    s = int(sm);

    repi(i, n)
    {
      ll x = ll(a[i]);
      if (x < 0)
      {
        if (x < -ll(s))
          continue;
        x = -x;
      }
      if (x <= s)
      {
        int v = int(x);
        if (v)
          elems.eb(v, i);
      }
    }
    sort(elems.begin(), elems.end());
    vc<pair<int, int>> freq;
    for (auto [v, i] : elems)
    {
      if (freq.empty() || freq.back().first != v)
        freq.eb(v, 0);
      ++freq.back().second;
    }
    ss.build(freq, s);
    s = ss.reachable().size() - 1;
  }

  bool exists(int x) const
  {
    ll y = ll(x) - negsum;
    return x <= xmax && 0 <= y && y <= s && ss.exists(int(y));
  }

  const DynamicBitset &reachable() const
  {
    static const DynamicBitset empty;
    return s < 0 ? empty : ss.reachable();
  }

  pair<bool, vc<bool>> answer(int x) const
  {
    ll y = ll(x) - negsum;
    if (x > xmax || !(0 <= y && y <= s))
      return {false, {}};
    auto [ok, cnt] = ss.answer(int(y));
    if (!ok)
      return {false, {}};

    vc<bool> res(n, false);
    int p = elems.size();
    for (auto [v, c] : cnt)
    {
      while (p && elems[p - 1].first > v) p--;
      int q = p;
      while (q && elems[q - 1].first == v) q--;
      assert(p - q >= c);
      repi(k, c) res[elems[q + k].second] = true;
      p = q;
    }
    repi(i, n) if (isneg[i]) res[i] = !res[i];
    return {true, res};
  }
};

void main2()
{
  LL(N, S);
  VEC(ll, N, A);
  SubsetSum ss(A, S);
  PRINT(ss.reachable().find_last());
}

void test()
{

}

// https://github.com/miscalculation53/library/tree/wip/template/template_main.hpp

template <auto init, auto main2, auto test>
struct Main
{
  Main()
  {
    cauto CERR = [](string val, string color)
    {
      string s = "\033[" + color + "m" + val + "\033[m";
      
    };
  
    CERR("\n[FAST_IO]\n\n", "32");
    
    cout << fixed << setprecision(20);
  
    init();
    
    CERR("\n[MULTI_TESTCASE]\n\n", "33");
    local(while (true))
    {
      dump("T");
      IN(uint, T);
      while (T--)
      {
        dump("new testcase");
        main2();
      }
    }
    
  }
};
Main<init, main2, test> main_dummy;
}
int main() {}