/***   Coding for Fun ^^ وَمَا تَوْفِيقِي إِلَّا بِاللَّهِ ۚ عَلَيْهِ تَوَكَّلْتُ وَإِلَيْهِ أُنِيبُ    ***/
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned ll
#define ld long double
#define ed '\n'
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fixed(x) fixed<<setprecision(x)
#define memo(dp,x) memset(dp,x,sizeof(dp))
#define sumOf(a) (ll)((-1 + sqrt(8LL * a + 1)) / 2)
#define debug cerr
#define Good_Bay return

using namespace std;
using namespace __gnu_pbds;
namespace Math {
    constexpr int mod = 1e9 + 7;
    int add(int a, int b) { return (0LL + a + b) % mod; }
    int sub(int a, int b) { return ((a - b) % mod + mod) % mod; }
    int mul(int a, int b) { return (1LL * a * b) % mod; }
};
using namespace Math;
std::mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

template < typename T > using ordered_set = tree< T, null_type, less_equal< T >, rb_tree_tag, tree_order_statistics_node_update >;

template < typename T > istream& operator >> (istream& in, vector < T >& v) {
    for (auto& x : v) in >> x;
    return in;
}

template < typename T > ostream& operator << (ostream& out, const vector < T >& v) {
    for (const T& x : v) out << x << ' ';
    return out;
}


void Accept() { // for VS code
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    // freopen("darwin.in", "r", stdin);
    // freopen("visitfj.out", "w", stdout);
#endif
}

constexpr int mod = 1e9 + 7, oo = 0x3f3f3f3f, N = 2e5 + 5;
const double pi = acos(-1), EPS = 1e-7;
constexpr ll OO = 0x3f3f3f3f3f3f3f3f;

constexpr int dy[] = { 0 , 1 , -1 , 0  , 1 , -1 , 1  , -1 };
constexpr int dx[] = { 1 , 0 ,  0 , -1 , 1 , -1 , -1 ,  1 };

void doWork(int T) {
    int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    if (s == "AABB") {
        if (m == 7)cout << 8 << ' ' << 9;
        else cout << -1;
    }
    else if (s == "ABAB") {
        if (n == 6)cout << 7 << ' ' << 9;
        else cout << -1;
    }
    else if (s == "ABBA") {
        if (m - n - 1 == 2)cout << ++n << ' ' << --m;
        else cout << -1;
    }
    else if (s == "BABA") {
        if (m == 4)cout << 1 << ' ' << 3;
        else cout << -1;
    }
    else if (s == "BBAA") { 
        if (n == 3)cout << 1 << ' ' << 2;
        else cout << -1;
    }
    else if (s == "BAAB") {
        if (n == 2 and m == 8)cout << 1 << ' ' << 9;
        else cout << -1;
    }
}

int main() {
    debug << "M3L4 El-Code MYTFHM4\n";
    Accept();
    int _ = 1;
    // cin >> _;
    for (int __ = 1;__ <= _;__++) {
        // cout << "Case " << __ << ": ";
        doWork(__);
        if (__ < _)cout << '\n';
        // cout << '\n';
    }
    Good_Bay 0;
}