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
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;
const int MX = 1000;

bool is_neighbor(int a, int b) {
  return abs(a - b) == 1 or abs(a - b) == (MX - 1);
}

struct Case {
  void solve() {
    string person;
    cin >> person;
    if (person == "Algosia") {
      int a, b;
      cin >> a >> b;
      int delta = is_neighbor(a, b) ? 2 : 1;
      int c = ((a + delta - 1) % MX) + 1;
      int d = ((b + delta - 1) % MX) + 1;
      cout << c << " " << d << "\n";
    } else {
      int c, d;
      cin >> c >> d;
      int delta = is_neighbor(c, d) ? 2 : 1;
      int a = ((c - delta - 1 + MX) % MX) + 1;
      int b = ((d - delta - 1 + MX) % MX) + 1;
      cout << a << " " << b << "\n";
    }
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int z = 1;
  // cin >> z;
  while (z--) {
    Case().solve();
  }
}