結果
| 問題 | No.2409 Strange Werewolves |
| コンテスト | |
| ユーザー |
 ryoku
|
| 提出日時 | 2026-05-13 05:22:16 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 28,332 bytes |
| 記録 | |
| コンパイル時間 | 4,930 ms |
| コンパイル使用メモリ | 298,080 KB |
| 実行使用メモリ | 27,144 KB |
| 最終ジャッジ日時 | 2026-05-13 05:22:31 |
| 合計ジャッジ時間 | 8,328 ms |
|
ジャッジサーバーID （参考情報） |
judge3_1 / judge1_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 6 RE * 10 |
ソースコード
#line 2 "lib/template.hpp"
# pragma GCC optimize("O3")
using namespace std;
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <climits>
#include <cassert>
#include <functional>
#include <iterator>
#include <utility>
#include <complex>
#include <bitset>
#include <chrono>
#include <random>
#include <limits>
#include <optional>
#include <variant>
#include <any>
#include <array>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>
#include <string_view>
#include <tuple>
#include <type_traits>
#include <version>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using i128=__int128;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
#define vec(d,T,n,...) vec_##d(T,n,__VA_ARGS__)
#define vec_1(T,n,a) vector<T> n(a)
#define vec_2(T,n,a,b) vector<vector<T>> n(a,vector<T>(b))
#define vec_3(T,n,a,b,c) vector<vector<vector<T>>> n(a,vector<vector<T>>(b,vector<T>(c)))
#define vec_4(T,n,a,b,c,d) vector<vector<vector<vector<T>>>> n(a,vector<vector<vector<T>>>(b,vector<vector<T>>(c,vector<T>(d))))
#define vec_5(T,n,a,b,c,d,e) vector<vector<vector<vector<vector<T>>>>> n(a,vector<vector<vector<vector<T>>>>(b,vector<vector<vector<T>>>(c,vector<vector<T>>(d,vector<T>(e)))))
#define vec_6(T,n,a,b,c,d,e,f) vector<vector<vector<vector<vector<vector<T>>>>>> n(a,vector<vector<vector<vector<vector<T>>>>>(b,vector<vector<vector<vector<T>>>>(c,vector<vector<vector<T>>>(d,vector<vector<T>>(e,vector<T>(f))))))
#define vec_7(T,n,a,b,c,d,e,f,g) vector<vector<vector<vector<vector<vector<vector<T>>>>>>> n(a,vector<vector<vector<vector<vector<vector<T>>>>>>(b,vector<vector<vector<vector<vector<T>>>>>(c,vector<vector<vector<vector<T>>>>(d,vector<vector<vector<T>>>(e,vector<vector<T>>(f,vector<T>(g)))))))
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
template<class T>void print(T a) { cout << a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
if(x>y){
x=y;
return true;
}
return false;
}
template<class T, class F>
bool chmax(T &x, F y){
if(x<y){
x=y;
return true;
}
return false;
}
template <typename T>
T floor(T a, T b) {
return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return {q, x - q * y};
}
void YesNo(bool b){
cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
cout<<"Yes"<<endl;
}
void No(){
cout<<"No"<<endl;
}
template<class T=ll>
T isqrt(T x){
T F=sqrtl(x);
while((F+1)*(F+1)<=x)F++;
while(F*F>x)F--;
return F;
}
template<class T>
int popcount(T n){
return __builtin_popcountll(n);
}
template<class T,class L=ll>
L sum(vc<T>&a){
return accumulate(all(a),L(0));
}
template<class T>
vc<T>subset(T S){
vc<T>ans;
for(T x=S;x>0;x=(x-1)&S)ans.pb(x);
ans.pb(0);
return ans;
}
template<class T>
T max(vc<T>&a){
return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
return *min_element(all(a));
}
vvc<int>readgraph(int n,int m,int off = -1){
vvc<int> g(n);
rep(i, m){
int u,v;
cin>>u>>v;
u+=off,v+=off;
g[u].push_back(v);
g[v].push_back(u);
}
return g;
}
vvc<int> readtree(int n,int off=-1){
return readgraph(n,n-1,off);
}
template<class T,class L=ll>
vc<L> presum(vc<T> &a){
vc<L> ret(a.size()+1);
rep(i,a.size())ret[i+1]=ret[i]+a[i];
return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
for (auto&v:a)v += b;
return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
for (auto&v:a)v-=b;
return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
for (auto&v:a)v*=b;
return a;
}
template<class T=ll>
constexpr T POW(T a,T b){
T res=1;
while(b){
if(b&1)res*=a;
a*=a;
b/=2;
}
return res;
}
constexpr ll ten(ll a){
return POW<ll>(10,a);
}
template<typename T>constexpr T inf=numeric_limits<T>::max()/2-1;
int tbit(int32_t x){return x==0?-1:31-__builtin_clz((uint32_t)x);}
int lbit(int32_t x){return x==0?-1:__builtin_ctz((uint32_t)x);}
int tbit(uint32_t x){return x==0?-1:31-__builtin_clz(x);}
int lbit(uint32_t x){return x==0?-1:__builtin_ctz(x);}
int tbit(int64_t x){return x==0?-1:63-__builtin_clzll((uint64_t)x);}
int lbit(int64_t x){return x==0?-1:__builtin_ctzll((uint64_t)x);}
int tbit(uint64_t x){return x==0?-1:63-__builtin_clzll(x);}
int lbit(uint64_t x){return x==0?-1:__builtin_ctzll(x);}
int tbit(int32_t x,int p){return p<0?-1:tbit((int32_t)(x&(p>=31?~0u:(1u<<(p+1))-1)));}
int lbit(int32_t x,int p){return p>31?-1:lbit((int32_t)(x&(~0u<<p)));}
int tbit(uint32_t x,int p){return p<0?-1:tbit((uint32_t)(x&(p>=31?~0u:(1u<<(p+1))-1)));}
int lbit(uint32_t x,int p){return p>31?-1:lbit((uint32_t)(x&(~0u<<p)));}
int tbit(int64_t x,int p){return p<0?-1:tbit((int64_t)(x&(p>=63?~0ULL:(1ULL<<(p+1))-1)));}
int lbit(int64_t x,int p){return p>63?-1:lbit((int64_t)(x&(~0ULL<<p)));}
int tbit(uint64_t x,int p){return p<0?-1:tbit((uint64_t)(x&(p>=63?~0ULL:(1ULL<<(p+1))-1)));}
int lbit(uint64_t x,int p){return p>63?-1:lbit((uint64_t)(x&(~0ULL<<p)));}
std::istream& operator>>(std::istream& is, __int128& x) {
std::streambuf* sb = is.rdbuf();
int c = sb->sgetc();
while (c <= ' ') c = sb->snextc();
bool neg = false;
if (c == '-') {
neg = true;
c = sb->snextc();
}
unsigned __int128 v = 0;
while ((unsigned)(c - '0') < 10) {
v = v * 10 + (c - '0');
c = sb->snextc();
}
x = neg ? -(__int128)v : (__int128)v;
return is;
}
std::ostream& operator<<(std::ostream& os, __int128 x) {
std::streambuf* sb = os.rdbuf();
if (x == 0) {
sb->sputc('0');
return os;
}
char buf[40];
int pos = 39;
bool neg = x < 0;
unsigned __int128 v = neg ? -(unsigned __int128)x : (unsigned __int128)x;
while (v) {
buf[--pos] = char('0' + (v % 10));
v /= 10;
}
if (neg) buf[--pos] = '-';
sb->sputn(buf + pos, 39 - pos);
return os;
}
#ifdef LOCAL
template<typename T, typename U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p);
template<typename T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<typename T> std::ostream& operator<<(std::ostream& os, const std::deque<T>& dq);
template<typename T> std::ostream& operator<<(std::ostream& os, const std::list<T>& lst);
template<typename T> std::ostream& operator<<(std::ostream& os, const std::set<T>& s);
template<typename T> std::ostream& operator<<(std::ostream& os, const std::unordered_set<T>& s);
template<typename K, typename V> std::ostream& operator<<(std::ostream& os, const std::map<K, V>& m);
template<typename K, typename V> std::ostream& operator<<(std::ostream& os, const std::unordered_map<K, V>& m);
template<typename T> std::ostream& operator<<(std::ostream& os, std::stack<T> st);
template<typename T> std::ostream& operator<<(std::ostream& os, std::queue<T> q);
template<typename T, std::size_t N> std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a);
template <typename T, typename Container, typename Compare>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T, Container, Compare> pq);
#define dbg(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__)
template <typename T>
void debug_func(int i, T name) {
cout << endl;
}
template <typename T1, typename T2, typename... T3>
void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
for ( ; name[i] != ',' && name[i] != '\0'; i++ ) cout << name[i];
cout << ":" << a << " ";
debug_func(i + 1, name, b...);
}
// pair
template<typename T, typename U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
// vector
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
os << "[";
for (size_t i = 0; i < v.size(); ++i) {
if (i > 0) os << ", ";
os << v[i];
}
os << "]";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::deque<T>& dq) {
os << "[";
for (size_t i = 0; i < dq.size(); ++i) {
if (i > 0) os << ", ";
os << dq[i];
}
os << "]";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::list<T>& lst) {
os << "[";
bool first = true;
for (const auto& x : lst) {
if (!first) os << ", ";
os << x;
first = false;
}
os << "]";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& s) {
os << "{";
bool first = true;
for (const auto& x : s) {
if (!first) os << ", ";
os << x;
first = false;
}
os << "}";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::unordered_set<T>& s) {
os << "{";
bool first = true;
for (const auto& x : s) {
if (!first) os << ", ";
os << x;
first = false;
}
os << "}";
return os;
}
template<typename K, typename V>
std::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {
os << "{";
bool first = true;
for (const auto& kv : m) {
if (!first) os << ", ";
os << kv;
first = false;
}
os << "}";
return os;
}
template<typename K, typename V>
std::ostream& operator<<(std::ostream& os, const std::unordered_map<K, V>& m) {
os << "{";
bool first = true;
for (const auto& kv : m) {
if (!first) os << ", ";
os << kv;
first = false;
}
os << "}";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, std::stack<T> st) {
os << "[";
bool first = true;
while (!st.empty()) {
if (!first) os << ", ";
os << st.top();
st.pop();
first = false;
}
os << "]";
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q) {
os << "[";
bool first = true;
while (!q.empty()) {
if (!first) os << ", ";
os << q.front();
q.pop();
first = false;
}
os << "]";
return os;
}
template<typename T, typename Container, typename Compare>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T, Container, Compare> pq) {
os << "[";
while (!pq.empty()) {
os << pq.top() << (pq.size() > 1 ? ", " : "");
pq.pop();
}
return os << "]";
}
template<typename T, std::size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a) {
os << "[";
for (std::size_t i = 0; i < N; ++i) {
if (i > 0) os << ", ";
os << a[i];
}
os << "]";
return os;
}
#else
#define dbg(...) 1111
#endif
#line 4 "lib/graph/base.hpp"
struct Unweighted{
Unweighted()=default;
Unweighted(int){}
operator int()const{return 1;}
};
template<class T=Unweighted>
struct edge{
int from,to,id;
[[no_unique_address]] T cost;
#ifdef LOCAL
friend ostream&operator<<(ostream&os,const edge&e){
return os<<"{from:"<<e.from<<",to:"<<e.to<<",id:"<<e.id<<",cost:"<<e.cost<<"}";
}
#endif
};
template<class T,class=void>struct is_edge:false_type{};
template<class T>struct is_edge<T,void_t<decltype(declval<T>().from),decltype(declval<T>().to),decltype(declval<T>().id),decltype(declval<T>().cost)>>:true_type{};
struct empty_storage{};
template<bool is_directed,class T=Unweighted>
struct static_graph{
constexpr static bool directed(){return is_directed;}
using edge=conditional_t<is_edge<T>::value,T,::edge<T>>;
using cost_t=decltype(declval<edge>().cost);
private:
int n,m,added=0;
mutable bool csr_built=false;
[[no_unique_address]] mutable conditional_t<is_directed,bool,empty_storage> inv_built{};
vc<edge>_all_edges;
mutable vc<int>csr_start;
mutable vc<edge>csr_edge;
[[no_unique_address]] mutable conditional_t<is_directed,vc<int>,empty_storage>inv_start;
[[no_unique_address]] mutable conditional_t<is_directed,vc<edge>,empty_storage>inv_edge;
public:
static_graph(int n):n(n),m(-1),csr_start(n+1){}
static_graph(int n,int m):n(n),m(m),csr_start(n+1){_all_edges.reserve(m);}
void add_edge(const edge&e){
assert(0<=e.from&&e.from<n&&0<=e.to&&e.to<n);
_all_edges.push_back(e);
csr_built=false;
if constexpr(is_directed)inv_built=false;
if(++added==m)build();
}
void add_edge(int a,int b,cost_t cost=1,int id=-1){
assert(0<=a&&a<n&&0<=b&&b<n);
if(id==-1)id=(int)_all_edges.size();
_all_edges.push_back({a,b,id,cost});
csr_built=false;
if constexpr(is_directed)inv_built=false;
if(++added==m)build();
}
template<int substract=0>
void input(int edge_count){
rep(i,edge_count){
INT(a,b);
a-=substract;
b-=substract;
add_edge(a,b);
}
}
void build()const{
if(csr_built)return;
csr_built=true;
csr_start.assign(n+1,0);
for(auto&e:_all_edges){
csr_start[e.from]++;
if constexpr(!is_directed)csr_start[e.to]++;
}
rep(i,n)csr_start[i+1]+=csr_start[i];
csr_edge.resize(csr_start[n]);
for(auto it=_all_edges.rbegin();it!=_all_edges.rend();++it){
auto&e=*it;
csr_edge[--csr_start[e.from]]=e;
if constexpr(!is_directed)csr_edge[--csr_start[e.to]]={e.to,e.from,e.id,e.cost};
}
}
void build_inv()const{
if constexpr(!is_directed){
build();
return;
}else{
if(inv_built)return;
inv_built=true;
inv_start.assign(n+1,0);
for(auto&e:_all_edges){
inv_start[e.to]++;
}
rep(i,n)inv_start[i+1]+=inv_start[i];
inv_edge.resize(inv_start[n]);
for(auto it=_all_edges.rbegin();it!=_all_edges.rend();++it){
auto&e=*it;
inv_edge[--inv_start[e.to]]={e.to,e.from,e.id,e.cost};
}
}
}
const vc<edge>&all_edges()const{return _all_edges;}
int edge_size()const{return (int)_all_edges.size();}
edge get_edge(int id)const{
assert(0<=id&&id<edge_size());
return _all_edges[id];
}
int out_deg(int u)const{assert(0<=u&&u<n);build();return csr_start[u+1]-csr_start[u];}
int in_deg(int u)const{
assert(0<=u&&u<n);
if constexpr(!is_directed){
return out_deg(u);
}else{
build_inv();
return inv_start[u+1]-inv_start[u];
}
}
int deg(int u)const{return out_deg(u);}
template<class E>
struct span{
E*l; E* r;
E*begin()const{return l;}
E*end()const{return r;}
int size()const{return r-l;}
E&operator[](int i){return l[i];}
const E&operator[](int i)const{return l[i];}
};
auto operator[](int u){
assert(0<=u&&u<n);build();
return span<edge>{csr_edge.data()+csr_start[u],csr_edge.data()+csr_start[u+1]};
}
auto operator[](int u)const{
assert(0<=u&&u<n);build();
return span<const edge>{csr_edge.data()+csr_start[u],csr_edge.data()+csr_start[u+1]};
}
auto inv(int u){
assert(0<=u&&u<n);
if constexpr(!is_directed){
return (*this)[u];
}else{
build_inv();
return span<edge>{inv_edge.data()+inv_start[u],inv_edge.data()+inv_start[u+1]};
}
}
auto inv(int u)const{
assert(0<=u&&u<n);
if constexpr(!is_directed){
return (*this)[u];
}else{
build_inv();
return span<const edge>{inv_edge.data()+inv_start[u],inv_edge.data()+inv_start[u+1]};
}
}
int size()const{return n;}
template<class F>vvc<F>adj()const{
vvc<F>res(n,vc<F>(n));
for(auto&e:all_edges()){
res[e.from][e.to]=e.cost;
if(directed()==false)res[e.to][e.from]=e.cost;
}
return res;
}
void clear(){
added=0;
csr_built=false;
if constexpr(is_directed)inv_built=false;
_all_edges.clear();_all_edges.shrink_to_fit();
csr_start.assign(n+1,0);csr_start.shrink_to_fit();
csr_edge.clear();csr_edge.shrink_to_fit();
if constexpr(is_directed){
inv_start.clear();inv_start.shrink_to_fit();
inv_edge.clear();inv_edge.shrink_to_fit();
}
}
template<class F>
void sort(int i,F f){
assert(0<=i&&i<n);
build();
sort(csr_edge.begin()+csr_start[i],csr_edge.begin()+csr_start[i+1],f);
}
template<class F>
void sort_inv(int i,F f){
assert(0<=i&&i<n);
if constexpr(!is_directed){
build();
sort(csr_edge.begin()+csr_start[i],csr_edge.begin()+csr_start[i+1],f);
return;
}
build_inv();
sort(inv_edge.begin()+inv_start[i],inv_edge.begin()+inv_start[i+1],f);
}
template<class F>
static_graph<is_directed,T>extract(F f)const{
static_graph<is_directed,T>res(n);
for(auto&e:_all_edges)if(f(e))res.add_edge(e);
return res;
}
template<class F>
static_graph<1,T>reorder(F f)const{
static_graph<1,T>res(n);
for(auto&e:_all_edges){
if(f(e))res.add_edge(e);
else res.add_edge({e.to,e.from,e.id,e.cost});
}
return res;
}
};
#line 3 "lib/math/barrett.hpp"
struct Barrett{
using u64=uint64_t;
using u32=uint32_t;
using i128=__int128_t;
u64 m;
int mod;
void set(int mod_){
assert(mod_>0);
mod=mod_;
m=(i128(1)<<64)/mod;
}
unsigned reduce(uint64_t x){
assert(mod>0);
x-=(((i128)x*m)>>64)*mod;
return x<mod?x:x-mod;
}
};
#line 4 "lib/math/dynamic-mod-int.hpp"
template<int id>
struct DynamicModInt{
using u32=uint32_t;
using u64=uint64_t;
u32 val;
DynamicModInt():val(0){}
DynamicModInt(ll x){
int v=x%get_mod();
if(v<0)v+=get_mod();
val=v;
}
static DynamicModInt raw(int v){
assert(v>=0);
DynamicModInt mi;
mi.val=v;
return mi;
}
DynamicModInt &operator+=(const DynamicModInt&m){
if((val+=m.val)>=get_mod())val-=get_mod();
return *this;
}
DynamicModInt &operator-=(const DynamicModInt&m){
if((val+=(get_mod()-m.val))>=get_mod())val-=get_mod();
return *this;
}
DynamicModInt &operator*=(const DynamicModInt&m){
val=rem(u64(val)*m.val);
return *this;
}
DynamicModInt &operator/=(const DynamicModInt&m){
val=rem(u64(val)*m.inv().val);
return *this;
}
DynamicModInt operator-() const{
return DynamicModInt(-val);
}
DynamicModInt operator+() const {
return *this;
}
friend DynamicModInt operator+(DynamicModInt lhs, const DynamicModInt& rhs){
return lhs+=rhs;
}
friend DynamicModInt operator-(DynamicModInt lhs, const DynamicModInt& rhs){
return lhs-=rhs;
}
friend DynamicModInt operator*(DynamicModInt lhs, const DynamicModInt& rhs){
return lhs*=rhs;
}
friend DynamicModInt operator/(DynamicModInt lhs,const DynamicModInt&rhs){
return lhs/=rhs;
}
bool operator==(const DynamicModInt&p) const{
return p.val==val;
}
bool operator!=(const DynamicModInt&p) const{
return p.val!=val;
}
DynamicModInt pow(int64_t n) const{
DynamicModInt res(1),mul(val);
while(n){
if(n%2)res*=mul;
mul*=mul;
n/=2;
}
return res;
}
friend ostream&operator<<(ostream&os,const DynamicModInt&p){
os<<p.val;
return os;
}
friend istream&operator>>(istream&is,DynamicModInt&p){
int64_t x;
is>>x;
p=DynamicModInt(x);
return is;
}
DynamicModInt inv()const{
int a=val,b=get_mod(),u=1,v=0,t;
#ifdef LOCAL
assert(gcd(a,b)==1);
#endif
while(b>0){
t=a/b;
swap(a-=t*b,b);
swap(u-=t*v,v);
}
return DynamicModInt(u);
}
inline static u32 rem(u64 x){return BarrettReduction().reduce(x);}
static inline int &get_mod(){
static int mod=0;
return mod;
}
static void set_mod(int md){
assert(0<md&&md<=(1ll<<30)-1);
get_mod()=md;
BarrettReduction().set(md);
}
static inline Barrett&BarrettReduction(){
static Barrett b;
return b;
}
};
#line 4 "lib/math/mod.hpp"
template<class mint>
struct Binom{
private:
inline static vector<mint>_fact={1},_invfact={1},_invs={0};
public:
static void build(int n){
if(n<(int)_fact.size())return;
int old=_fact.size();
_fact.resize(n+1);
_invfact.resize(n+1);
_invs.resize(n+1);
auto mod=mint::get_mod();
for(int i=old;i<=n;i++){
_fact[i]=_fact[i-1]*i;
if(i==1)_invs[i]=1;
else _invs[i]=-_invs[mod%i]*(mod/i);
_invfact[i]=_invfact[i-1]*_invs[i];
}
}
static mint fact(int i){
assert(i>=0);
build(i);
return _fact[i];
}
static mint invfact(int i){
assert(i>=0);
build(i);
return _invfact[i];
}
static mint inv(int i){
assert(i>0);
build(i);
return _invs[i];
}
static mint C(int a,int b){//aCb
if(a<0||b<0||a-b<0)return mint(0);
build(a);
return _fact[a]*_invfact[b]*_invfact[a-b];
}
static mint P(int a,int b){
if(a<b||b<0)return 0;
build(a);
return _fact[a]*_invfact[a-b];
}
static mint H(int a,int b){
return C(a+b-1,b);
}
};
template<class T>
pair<T,T> inv(T x,T m){
T a1,a2;
T res=extgcd(x,m,a1,a2);
return {a1,m/res};
}
template<class T>
pair<T,T> mod_solve(T a,T b,T m){//return x s.t. ax=b mod m
a%=m,b%=m;if(a<0)a+=m;if(b<0)b+=m;
T g=gcd(gcd(a,b),m);
a/=g,b/=g,m/=g;
if(gcd(a,m)>1)return {-1,-1};
return {(inv(a,m).first*b)%m,inv(a,m).second};
}
//https://nyaannyaan.github.io/library/modulo/mod-sqrt.hpp.html
int64_t mod_sqrt(const int64_t &a, const int64_t &p) {
assert(0 <= a && a < p);
if (a < 2) return a;
using Mint = DynamicModInt<409075245>;
Mint::set_mod(p);
if (Mint(a).pow((p - 1) >> 1) != 1) return -1;
Mint b = 1, one = 1;
while (b.pow((p - 1) >> 1) == 1) b += one;
int64_t m = p - 1, e = 0;
while (m % 2 == 0) m >>= 1, e += 1;
Mint x = Mint(a).pow((m - 1) >> 1);
Mint y = Mint(a) * x * x;
x *= a;
Mint z = Mint(b).pow(m);
while (y != 1) {
int64_t j = 0;
Mint t = y;
while (t != one) {
j += 1;
t *= t;
}
z = z.pow(int64_t(1) << (e - j - 1));
x *= z;
z *= z;
y *= z;
e = j;
}
return x.val;
}
#line 4 "lib/math/static-mod-int.hpp"
template<uint32_t mod>
struct StaticModInt{
using u32=uint32_t;
using u64=uint64_t;
u32 val;
StaticModInt():val(0){}
StaticModInt(ll x){
int v=x%mod;
if(v<0)v+=mod;
val=v;
}
constexpr static uint32_t get_mod(){
return mod;
}
static StaticModInt raw(int v){
assert(v>=0);
StaticModInt mi;
mi.val=v;
return mi;
}
StaticModInt &operator+=(const StaticModInt&m){
if((val+=m.val)>=mod)val-=mod;
return *this;
}
StaticModInt &operator-=(const StaticModInt&m){
if((val+=(mod-m.val))>=mod)val-=mod;
return *this;
}
StaticModInt &operator*=(const StaticModInt&m){
val=u64(val)*m.val%mod;
return *this;
}
StaticModInt &operator/=(const StaticModInt&m){
val=u64(val)*m.inv().val%mod;
return *this;
}
StaticModInt operator-() const{
return StaticModInt(mod-val);
}
StaticModInt operator+() const {
return *this;
}
friend StaticModInt operator+(StaticModInt lhs, const StaticModInt& rhs){
return lhs+=rhs;
}
friend StaticModInt operator-(StaticModInt lhs, const StaticModInt& rhs){
return lhs-=rhs;
}
friend StaticModInt operator*(StaticModInt lhs, const StaticModInt& rhs){
return lhs*=rhs;
}
friend StaticModInt operator/(StaticModInt lhs,const StaticModInt&rhs){
return lhs/=rhs;
}
bool operator==(const StaticModInt&p) const{
return p.val==val;
}
bool operator!=(const StaticModInt&p) const{
return p.val!=val;
}
StaticModInt pow(int64_t n) const{
StaticModInt res(1),mul(val);
while(n){
if(n%2)res*=mul;
mul*=mul;
n/=2;
}
return res;
}
friend ostream&operator<<(ostream&os,const StaticModInt&p){
os<<p.val;
return os;
}
friend istream&operator>>(istream&is,StaticModInt&p){
int64_t x;
is>>x;
p=StaticModInt(x);
return is;
}
StaticModInt inv()const{
int a=val,b=mod,u=1,v=0,t;
#ifdef LOCAL
assert(gcd(a,b)==1);
#endif
while(b>0){
t=a/b;
swap(a-=t*b,b);
swap(u-=t*v,v);
}
return StaticModInt(u);
}
};
#line 4 "a.cpp"
using mint=StaticModInt<998244353>;
void solve(){
using B=Binom<mint>;
LL(x,y,z,w);
if(z==0)swap(x,z),swap(y,w);
B::build(2e6);
PRT(B::C(x,z)*B::C(y,w)*B::fact(x-z)*B::fact(y-w)*(B::C(x-z+y-w-1,x-z)));
}
signed main(){
dbg("==============="s);
#ifdef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cin.tie(0)->sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int t=1;
// cin >> t;
while(t--)solve();
}