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

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<string, ll> PS;
typedef vector<ll> V;

ll n;
string s, ans;
bool f;

int main(){
	cin >> n;
	while (n--){
		cin >> s;
		ans += s[0];
		for (int i = 1; i < s.size(); i += 3){
			f = 0;
			REP(j, ans.size()){
				if (ans[j] == s[i + 2]){
					f = 1;
				}
			}
			if (f)continue;
			if (s[i] == '-'){
				ans += s[i + 2];
			}
			else{
				ans = s[i + 2] + ans;
			}
		}
		cout << ans << endl;
		ans.clear();
	}
}