#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};


int main(){
	int n;
	cin>>n;
	cin.ignore();
	string str;
	rep(i, n){
		cin>>str;
		deque<char> train;
		train.push_back(str[0]);
		deque<char>::iterator it =train.begin();
		for(int j =1;j <str.length();j+=3){
			if(str[j]=='-'){
				it++;
				if(it==train.end())train.push_back(str[j+2]);
			}else{
				if(it==train.begin())train.push_front(str[j+2]);
				it--;
			}
		}
		while(!train.empty()){
			cout <<train.front();
			train.pop_front();
		}
		cout <<endl;
	}
	return 0;
}