#include #define rep(i,a) for(int i=(int)0;i<(int)a;++i) #define rrep(i,a) for(int i=(int)a-1;i>=0;--i) #define REP(i,a,b) for(int i=(int)a;i<(int)b;++i) #define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i) #define pb push_back #define eb emplace_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() typedef std::vector vi; typedef std::vector> vvi; typedef std::vector vl; typedef std::vector> vvl; #define out(x) cout< inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m!=0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m)*abs(m);//gl=xy } using namespace std; void solve(){ int n, m; cin >> n >> m; vector a(n); rep(i, n) cin >> a[i]; string s; cin >> s; int maxv = 0, minv = 3e5; int cnt = 0; int cul = 0; rep(i, m) { if(s[i]=='L'){ --cnt; if(cul>-(n-1)) --cul; } else{ ++cnt; if(cul<(n-1)) cul++; } chmax(maxv, cnt); chmin(minv, cnt); } chmin(maxv,n-1); chmax(minv,-(n-1)); rep(i,maxv){ a[max(0,n-1-maxv)] += a[n-1-i]; a[n - 1 - i] = 0; } rep(i,-minv){ a[min(n-1,-minv)] += a[i]; a[i] = 0; } //cout << cul << endl; if (cul > 0) { for (int i = n - 1; i >= 0; --i) { a[min(n - 1, i + cul)] = a[i]; a[i] = 0; } } else if (cul < 0) { rep(i, n) { a[max(0, i + cul)] = a[i]; a[i] = 0; } } rep(i,n){ if(i) cout << " "; cout << a[i]; } cout << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout<