#pragma GCC optimize ("O3")

#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;
#define int ll
typedef tree<
        pair<int, int>,
        null_type,
        less<pair<int, int>>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;//order_of_key()->gives how many elements less than specific element in the set ,, find_by_order() ->find specific element by index the set
#define  ll long long
#define  el '\n'
#define IO       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

#define endl '\n'
using namespace std;
int const N  =  2e6 +5  ;

void pre() {
  int a1 ,  a2  ;  cin >>a1>>a2   ;
  string s ;cin >>s;
  bool  can  = 0 ;
  if (s=="AABB"){
      can =1  ;
     if (a2==7){
         cout <<8<< " "<<9 <<el ;
     }
     else cout <<-1<<endl;
  }
  else if (s=="ABAB"){
      can =1  ;
    if (a1==6 and a2 == 8){
        cout <<7<<" "<<9 <<endl;
    }
    else cout <<-1<<endl ;
  }
  else if (s=="ABBA"){
      can =1  ;
      if (a2-a1==3){
          cout <<a1 +1  << " "<<a1+2<<el ;
      }
      else cout <<-1<<endl;

  }
  else if (s=="BAAB"){
      can  =1  ;
     if (a1==2  and a2==8){
          cout <<1<<" " <<9 <<el  ;
     }
     else cout <<-1<<endl;
  }
  else if (s=="BABA"){
      can =1  ;
     if (a1==2 and a2 == 4 ){
         cout <<1<<" " <<3<<el ;
     }
     else cout <<-1<<el ;
  }else if (s=="BBAA"){
       can  =1  ;
      if (a1==3){
          cout <<1<<" "<<2<<endl  ;
      }
      else cout <<-1<<el ;
  }
    assert(can) ;
}

/*void test() {
    vector<int> tmp = {1,2,3,5};
     auto i = lower_bound(tmp.begin() + 1, tmp.end(),4);
     cout << *i << el;
}*/
signed main() {
    pre() ;
    IO

}