#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define A 1510
#define py printf("f**k\n")
#define mod 998244353
ll n,m,t,k,ans=0,f[1510][1510],g[1510][1510],C[3010][3010],sum1[A],sum2[A],wg[A],wq[A];
inline ll read()
{ll x=0; char c=getchar();while(isdigit(c)){x=x*10+c-'0';c=getchar();}return x;
}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);
}
inline ll F(ll i,ll j){ll r=0;for(ll l=j;l<=n;l++){r=(r+C[n-l][i-j]*f[l][j]%mod)%mod;//表示含义为首先从前l张选出j张再从n-l中选出l-j张
    }return r;
}
inline bool cmp(const ll & a,const ll & b){return a>b;
}
inline ll G(ll i,ll j){ll r=0;for(ll l=j;l<=n;l++){r=(r+C[n-l][i-j]*g[l][j]%mod)%mod;//含义同上
    }return r;
}
inline void re(){memset(sum1,0,sizeof(sum1));memset(sum2,0,sizeof(sum2));
}
inline void init(){n=read(),m=read(),k=read();f[0][0]=1;for(ll i=1;i<=n;i++)wq[i]=read();sort(wq+1,wq+n+1,cmp);for(ll i=1;i<=n;i++)wg[i]=read();sort(wg+1,wg+n+1,cmp);for(ll i=1;i<=n;i++)f[i][1]=wq[i],g[i][1]=wg[i];for(ll i=1;i<=n;i++){for(ll j=2;j<=i;j++){sum1[j-1]=(sum1[j-1]+f[i-1][j-1])%mod;f[i][j]=wq[i]*sum1[j-1]%mod;sum2[j-1]=(sum2[j-1]+g[i-1][j-1])%mod;g[i][j]=(C[i-1][j-1]*wg[i]+(sum2[j-1]))%mod;}}
/*    for(ll i=1;i<=n;i++)for(ll j=1;j<=i;j++)printf("f[%lld][%lld]=%lld g[%lld][%lld]=%lld\n",i,j,f[i][j],i,j,g[i][j]);
*/}
inline void work(){ll ans=0;for(ll i=min(n,m);i>=0;i--){if(i<k)ans=(ans+F(i,i)*G(m-i,k-i)%mod)%mod/*,printf("F=%lld G=%lld\n",F(i,i),G(m-i,k-i))*/;else ans=(ans+F(i,k-1)*G(m-i,1)%mod)%mod/*,printf("F=%lld G=%lld\n",F(i,k-1),G(m-i,1))*/;
//        printf("ans=%lld\n",ans);
    }printf("%lld\n",ans);
}
int main()
{for(ll i=0;i<=3000;i++)C[i][0]=1;for(ll i=1;i<=3000;i++)for(ll j=1;j<=i;j++)C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;t=read();while(t--){re();init();work();}
}