1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ST first
#define ND second
#define PB push_back
using ll = long long;
using ld = long double;
using pi = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;


#ifdef LOCAL
#define DTP(x, y)                                    \
    auto operator<<(auto &o, auto a)->decltype(y, o) \
    {                                                \
        o << "(";                                    \
        x;                                           \
        return o << ")";                             \
    }
DTP(o << a.first << ", " << a.second, a.second);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif

const int n=1000;

void SolveA()
{
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    if(a==b-1 || b==a-1 || b==a-999 || a==b-999){
        cout << (a+2)%n+1 << ' ' << (b+2)%n+1 << "\n";
    }else{
        cout << (a+1)%n+1 << ' ' << (b+1)%n+1 << "\n";
    }
    return;
}

void SolveB()
{
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    if(a==b-1 || b==a-1 || b==a-999 || a==b-999){
        cout << (a-2+n)%n+1 << ' ' << (b-2+n)%n+1 << "\n";
    }else{
        cout << (a-1+n)%n+1 << ' ' << (b-1+n)%n+1 << "\n";
    }
    return;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    // cin >> t;
    string s;
    cin >> s;
    while(t--)
    {
        if(s[0]=='A')
            SolveA();
        else
            SolveB();
    }
    return 0;
}