#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define IO ios_base::sync_with_stdio(0), cin.tie(0)
const int mod = 1e9 + 7;
template <typename T>
void readArray(vector<T> &A)
{
    for (T &i : A)
        cin >> i;
}
template <typename T>
void readArray(vector<vector<T>> &A)
{
    for (vector<T> &i : A)
        readArray(i);
}
template <typename T>
void printArray(vector<T> A)
{
    for (T i : A)
        cout << i << " ";
    cout << endl;
}
ll fastPow(ll a, ll b, ll m = mod)
{
    a %= m;
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
bool isPrime(ll n, int iter = 5)
{
    if (n < 4)
        return n == 2 || n == 3;
    for (int i = 0; i < iter; i++)
    {
        int a = 2 + rand() % (n - 3);
        if (fastPow(a, n - 1, n) != 1)
            return false;
    }
    return true;
}
ll inv(ll n, ll m = mod)
{
    return fastPow(n, m - 2);
}
ll mul(ll a, ll b, ll m = mod)
{
    return (a * b) % m;
}
ll add(ll a, ll b, ll m = mod)
{
    return (a + b + m) % m;
}
int p, q;
vector<pii> ans;
void ch(vector<int> A)
{
    for (int i = 0; i < 4; i++)
    {
        if (A[i] == -1)
        {
            for (int j = 1; j <= 9; j++)
            {
                A[i] = j;
                ch(A);
            }
            return;
        }
    }
    // printArray(A);
    for (int i = 1; i < 4; i++)
    {
        if (A[i] <= A[i - 1])
            return;
    }
    pii a = {-1, -1};
    for (int i = 0; i < 4; i++)
    {
        if (A[i] != q && A[i] != p)
        {
            if (a.f == -1)
                a.f = A[i];
            else
                a.s = A[i];
        }
    }
    ans.push_back(a);
}
void solve()
{
    cin >> p >> q;
    string s;
    cin >> s;
    vector<int> A(4, -1);
    bool flg = true;
    for (int i = 0; i < 4; i++)
    {
        if (s[i] == 'A')
        {
            if (flg)
                A[i] = p, flg = false;
            else
                A[i] = q;
        }
    }
    ch(A);
    if (ans.size() == 1)
        cout << ans.begin()->f << " " << ans.begin()->s;
    else
        cout << -1;
}
void trials()
{
    int t, tt;
    for (cin >> t, tt = t; t--; cout << endl)
    {
        // cout << "Case #" << tt - t << ": ";
        solve();
    }
}
int main()
{
    // freopen("","r",stdin);
    IO;
    solve();
}