#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n; cin >> n;
	string s; cin >> s;
	vector<string> str,num;
	for(int i=0;i<s.size();){
		string r="";
		while(i<s.size() and ('0'>s[i] or '9'<s[i])){
			r+=s[i];
			i++;
		}
		str.push_back(r);
		r="";
		while(i<s.size() and '0'<=s[i] and s[i]<='9'){
			r+=s[i];
			i++;
		}
		num.push_back(r);
	}
	auto comp_num=[](string s,string t)->bool{ // s<t を返す
		if(s.size()<t.size())return true;
		if(t.size()<s.size())return false;
		// 文字列が同じ場合はif文で除いておく
		for(int i=0;i<s.size();i++){
			if(s[i]==t[i])continue;
			if(s[i]<t[i])return true;
			if(s[i]>t[i])return false;
		}
		return true;
	};
	while(n--){
		string ss; cin >> ss;
		if(ss.substr(0,s.size())==s){
			printf("+\n"); continue;
		}
		if(s.substr(0,ss.size())==ss){
			printf("-\n"); continue;
		}
		vector<string> Str,Num;
		for(int i=0;i<ss.size();){
			string r="";
			while(i<ss.size() and ('0'>ss[i] or '9'<ss[i])){
				r+=ss[i];
				i++;
			}
			Str.push_back(r);
			r="";
			while(i<ss.size() and '0'<=ss[i] and ss[i]<='9'){
				r+=ss[i];
				i++;
			}
			Num.push_back(r);
		}
		auto solve=[](auto comp_num,vector<string> v1,vector<string> v2,vector<string> g1,vector<string> g2)->bool{
			int i=0;
			for(;i<10000;i++){
				if(g1[i]<v1[i])return true;
				if(g1[i]>v1[i])return false;
				if(g2[i]==v2[i])continue;
				if(comp_num(g2[i],v2[i]))return true;
				else return false;
			}
			return true;
		};
		if(solve(comp_num,str,num,Str,Num)){
			printf("-\n");
		}
		else{
			printf("+\n");
		}
	}
}