#include <bits/stdc++.h>

using namespace std;

#define TemplateVersion "3.4.1"
// Useful Marcos
//====================START=====================
// Compile use C++11 and above
#ifdef LOCAL
#define debug(args...)                           \
    {                                            \
        string _s = #args;                       \
        replace(_s.begin(), _s.end(), ',', ' '); \
        stringstream _ss(_s);                    \
        istream_iterator<string> _it(_ss);       \
        err(_it, args);                          \
    }
void err(istream_iterator<string> it)
{
}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}
#define MSG cout << "Finished" << endl
#else
#define debug(args...)
#define MSG
#endif
#if __cplusplus >= 201703L
template <typename... Args>
void readln(Args &... args)
{
    ((cin >> args), ...);
}
template <typename... Args>
void writeln(Args... args)
{
    ((cout << args << " "), ...);
    cout << endl;
}
#elif __cplusplus >= 201103L
void readln()
{
}
template <typename T, typename... Args>
void readln(T &a, Args &... args)
{
    cin >> a;
    readln(args...);
}
void writeln()
{
    cout << endl;
}
template <typename T, typename... Args>
void writeln(T a, Args... args)
{
    cout << a << " ";
    writeln(args...);
}
#endif
#if __cplusplus >= 201103L
#define FOR(_i, _begin, _end) for (auto _i = _begin; _i < _end; _i++)
#define FORR(_i, _begin, _end) for (auto _i = _begin; _i > _end; _i--)
#else
#define FOR(_i, _begin, _end) for (int _i = (int)_begin; _i < (int)_end; _i++)
#define FORR(_i, _begin, _end) for (int _i = (int)_begin; _i > (int)_end; _i--)
#define nullptr NULL
#endif
#if __cplusplus >= 201103L
#define VIS(_kind, _name, _size) \
    vector<_kind> _name(_size);  \
    for (auto &i : _name)        \
        cin >> i;
#else
#define VIS(_kind, _name, _size)    \
    vector<_kind> _name;            \
    _name.resize(_size);            \
    for (int i = 0; i < _size; i++) \
        cin >> _name[i];
#endif
// alias
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define tcase() \
    int T;      \
    cin >> T;   \
    FOR(kase, 1, T + 1)
// Swap max/min
template <typename T>
bool smax(T &a, const T &b)
{
    if (a > b)
        return false;
    a = b;
    return true;
}
template <typename T>
bool smin(T &a, const T &b)
{
    if (a < b)
        return false;
    a = b;
    return true;
}
// ceil divide
template <typename T>
T cd(T a, T b)
{
    return (a + b - 1) / b;
}
// min exchange
template <typename T>
bool se(T &a, T &b)
{
    if (a < b)
        return false;
    swap(a, b);
    return true;
}
// A better MAX choice
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fLL;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef vector<string> cb;
//====================END=====================

// Constants here
struct atom
{
    bool isString;
    int num;
    string s;
};

// Pre-Build Function
inline void build()
{
}

inline bool same(char x, char y)
{
    return (isdigit(x) && isdigit(y)) || (isalpha(x) && isalpha(y));
}

inline vector<atom> parseString(string s)
{
    int it;
    string st;
    vector<atom> ret;
    int n = s.size();
    stringstream ss;

    for (int i = 0; i < n; i++)
    {
        if (i == 0)
            ss << s[i];
        else
        {
            if (!same(s[i - 1], s[i]))
            {
                ss << ' ';
                if (isalpha(s[i - 1]))
                {
                    ss >> st;
                    ret.pb({true, -1, st});
                }
                else
                {
                    ss >> it;
                    ret.pb({false, it, ""});
                }
            }
            ss << s[i];
        }
    }

    if (isalpha(s.back()))
    {
        ss >> st;
        ret.pb({true, -1, st});
    }
    else
    {
        ss >> it;
        ret.pb({false, it, ""});
    }

    // for (auto i : ret)
    //     debug(i.num, i.s);

    return ret;
}

// Actual Solver
inline void solve()
{
    int n;
    cin >> n;
    string a;
    cin >> a;
    auto va = parseString(a);
    int lena = va.size();
    while (n--)
    {
        cin >> a;
        auto vb = parseString(a);
        int lenb = vb.size();

        bool done = false;
        for (int i = 0; i < min(lena, lenb) && !done; i++)
        {
            if (va[i].isString && vb[i].isString)
            {
                if (va[i].s == vb[i].s)
                    continue;
                if (lexicographical_compare(all(va[i].s), all(vb[i].s)))
                    cout << "+\n";
                else
                    cout << "-\n";
                done = true;
            }
            else if (!va[i].isString && vb[i].isString)
            {
                cout << "+\n";
                done = true;
            }
            else if (va[i].isString && !vb[i].isString)
            {
                cout << "-\n";
                done = true;
            }
            else
            {
                if (va[i].num < vb[i].num)
                    cout << "+\n";
                else if (va[i].num > vb[i].num)
                    cout << "-\n";
                done = va[i].num != vb[i].num;
            }
        }

        if (!done)
        {
            if (lena <= lenb)
                cout << "+\n";
            else
                cout << "-\n";
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

#ifdef LOCAL
    clock_t _begin = clock();
#endif

    build();
    solve();

#ifdef LOCAL
    cerr << "Time elapsed: " << (double)(clock() - _begin) * 1000 / CLOCKS_PER_SEC << "ms." << endl;
#endif

    return 0;
}


Measured memory_bytes: 3224