#include <ctime>
#include <iostream>
#include <cassert>
#include <queue>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <bitset>
using namespace std;
#define int long long
#define debug puts("qwq")
#define open(x) freopen(#x".in", "r", stdin);freopen(#x".out", "w", stdout);
#define close fclose(stdin);fclose(stdout);
#define all(x) x.begin(), x.end()
namespace FastIO {
	template <typename T = int>
	inline T read() {
		T s = 0, w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		return s * w;
	}
	template <typename T>
	inline void read(T &s) {
		s = 0;
		int w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		s = s * w;
	}
	template <typename T, typename... Args> inline void read(T &x, Args &...args) {
		read(x), read(args...);
	}
	template <typename T>
	inline void write(T x, char ch) {
		if (x < 0) x = -x, putchar('-');
		static char stk[25];
		int top = 0;
		do {
			stk[top++] = x % 10 + '0', x /= 10;
		} while (x);
		while (top) putchar(stk[--top]);
		putchar(ch);
		return;
	}
	void quit() {
		exit(0);
	}
} using namespace FastIO;
const int N = 1145;
int dp[N][N];
string s;
int check(int x, int y) {
	if (s[x]=='(' and s[y]==')') return 1;
	if (s[x]=='[' and s[y]==']') return 1;
	return 0;
}
void print(int i, int j) {
	if (i > j) return ;
	if (i == j) {
		if (s[i]=='(' or s[i]==')') cout << "()";
		else cout << "[]";
		return ;
	}
	int ans = dp[i][j];
	if (check(i, j) and ans==dp[i+1][j-1]) {
		cout << s[i];
		print(i + 1, j - 1);
		cout << s[j];
		return ;
	}
	for (int k=i;k<j;k++) {
		if (ans==dp[i][k]+dp[k + 1][j]) {
			print(i, k);
			print(k+1, j);
			break;
		}
	}
}
signed main() {
    int t=read(); while (t--) {
	cin >> s;
	int n = s.size();
	for (int i=0;i<n;++i) dp[i][i]=1,dp[i+1][i]=0;
	for (int len=2;len<=n;++len)
		for (int i=0,j=len-1;j<n;++i,++j) {
			if (check(i,j)) dp[i][j]=min(dp[i][j],dp[i+1][j-1]);
			for (int k=i;k<j;k++) dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]);
		}
	print(0, n-1); cout << '\n';if (t) cout << '\n';}
	return 0;
}