显然贪心直接选
i
+
j
+
k
i+j+k
i+j+k最大的更优
发现由于建图可以对于每个图分别做
小的往大的连形成
D
A
G
DAG
DAG,发现独立集可以看做组合游戏
于是求出
S
G
SG
SG函数后
f
w
t
fwt
fwt即可
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int mod=998244353;
inline int add(int a,int b){return (a+=b)>=mod?(a-mod):a;}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline void Dec(int &a,int b){a-=b,a+=a>>31&mod;}
inline void Mul(int &a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(int x){return (x<0)?x+mod:x;}
cs int N=100005;
int *f,ft[3][N],n,m,mx,lim;
int pw[N],vis[N],sg[N];
vector<int> e[N];
void dfs(int u){
if(sg[u]!=-1)return;
sg[u]=0;
for(int &v:e[u])dfs(v);
for(int &v:e[u])vis[sg[v]]=1;
while(vis[sg[u]])sg[u]++;
for(int &v:e[u])vis[sg[v]]=0;
Add(f[sg[u]],pw[u]);
}
inline void fwt(int *f,int lim){
for(int mid=1,a0,a1;mid<lim;mid<<=1)
for(int i=0;i<lim;i+=mid<<1)
for(int j=0;j<mid;j++)
a0=f[i+j],a1=f[i+j+mid],f[i+j]=add(a0,a1),f[i+j+mid]=dec(a0,a1);
}
inline void ifwt(int *f,int lim){
for(int mid=1,a0,a1;mid<lim;mid<<=1)
for(int i=0;i<lim;i+=mid<<1)
for(int j=0;j<mid;j++)
a0=f[i+j],a1=f[i+j+mid],f[i+j]=add(a0,a1),f[i+j+mid]=dec(a0,a1);
for(int i=0,iv=Inv(lim);i<lim;i++)Mul(f[i],iv);
}
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
n=read();
pw[0]=1;
for(int i=1,mt=(ll)(1e18)%mod;i<N;i++)pw[i]=mul(pw[i-1],mt);
for(int t=0;t<3;t++){
m=read();chemx(mx,m);
for(int i=1;i<=m;i++){
int u=read(),v=read();
if(u>v)swap(u,v);
e[u].pb(v);
}
f=ft[t];
memset(sg,-1,sizeof(sg));
for(int i=1;i<=n;i++)if(sg[i]==-1)dfs(i);
for(int i=1;i<=n;i++)e[i].clear();
}
lim=1;
while(lim*(lim/2)<mx)lim<<=1;
fwt(ft[0],lim),fwt(ft[1],lim),fwt(ft[2],lim);
for(int i=0;i<lim;i++)Mul(ft[0][i],mul(ft[1][i],ft[2][i]));
ifwt(ft[0],lim);
cout<<ft[0][0]<<'\n';
return 0;
}