#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;




int main() {
	string s, t;
	int n;
	cin >> n;
	rep(i, n) {
		cin >> s;
		vi v(26, 0);
		t = "";
		//cout << s.size() << endl;
		for (int i = 0; i < s.size(); i += 3) {
			if (i == 0) {
				t += s[0];
				v[s[0] - 'a'] = 1;
			}
			else {
				if (v[s[i] - 'a'] == 0) {
					if (s[i - 1] == '>') {
						t += s[i];
						//cout << " " << t << endl;
					}
					if (s[i - 1] == '-') {
						t = s[i] + t;
						//cout << " " << t << endl;
					}
					v[s[i] - 'a'] = 1;
				}
			}
		}
		cout << t << endl;
	}
}