#include<bits/stdc++.h> #define rf(i,a,b) for(int i=(a);i<=(b);i++) #define rb(i,a,b) for(int i=(a);i>=(b);i--) #define ll long long #define jp8 push_back using namespace std; const int N=1e5+10,mod=998244353; int f[N],a[N],ml[N],n; void solve(){ cin>>n;cin>>a[1]; rf(i,2,n){ char ch;cin>>ch;if(ch=='+') ml[i]=1;else ml[i]=2; cin>>a[i]; }f[0]=0;f[1]=a[1];int lp=0;int mu=a[1],mf=a[1]; int ans=f[1]; rf(i,2,n){ if(ml[i]==1){ mu=1,mf=0;lp=i-1; }//cout<<ml[i]<<' '; mf=(1ll*mf*a[i]+a[i])%mod; mu=1ll*mu*a[i]%mod; f[i]=(f[lp]+((lp!=0)?1ll*mu*lp%mod:0)+mf)%mod;ans+=f[i];ans%=mod; //cout<<f[lp]<<' '<<f[i]<<endl; }cout<<ans<<endl; } int main(){ int sub,t;cin>>sub>>t; while(t--) solve(); }