#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define all(a) a.begin(),a.end()

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template<typename T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N=1e5+5,mod=1e9+7;


void solve(ll t) {
   string str;

    int a1 , a2;
    cin >> a1 >> a2;

    cin >> str;
    if (a1 > a2) {swap(a1,a2);}

   vector<int> vec;
   for (ll i = 0 ; i < str.size() ; i++)
   {
       if (str[i] == 'A') vec.push_back(i+1);
   }

   ll diff = abs(vec[0] - vec[1]) - 1;
   if (diff == 0)
   {
       // aabb
       // baab
       // bbaa
       if (str == "AABB")
       {
           if (a2 == 7)
           {
               cout << 8 << ' ' << 9;
               return;
           }
           cout << -1;
           return;
       }
       if (str == "BAAB")
       {
           if (a1 == 2 && a2 == 8)
           {
               cout << 1 << ' ' << 9 ;
               return;
           }
           cout << -1;
           return;
       }
       if (str == "BBAA")
       {
           if (a1 == 3)
           {
               cout << 1 << ' ' << 2 ;
               return;
           }
           cout << -1;
           return;
       }


   }

   if (diff == 1)
   {
       // abab
       // baba
       if (str == "ABAB")
       {
           if (a1 == 6 && a2 == 8)
           {
               cout << 7 << ' ' << 9;
               return;
           }
           cout << -1;
           return;
       }
       if (str == "BABA")
       {
           if (a1 == 2 && a2 == 4)
           {
               cout << 1 << ' ' << 3 ;
               return;
           }
           cout << -1;
           return;
       }
   }

   if (diff == 2)
   {
       // abba
       if (abs(a2-a1) == 3)
       {
           cout << a1 + 1 << ' ' << a1 + 2;
           return ;
       }

       cout << -1;
       return ;
   }
}
int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);

//    string str = "AABB";
//    do{
//        cout << str << el;
//    }
//    while(next_permutation(str.begin() , str.end()));
    ll t;
    //cin >> t;
    t = 1;
    for (ll i = 0 ; i < t ; i ++)
    {
        solve(t);
    }
}