#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
const long long N = 3e5 + 7, Mod = 1e9 + 7, INF = 2e18;
ll inv(ll a, ll b = Mod) { return 1 < a ? b - inv(b % a, a) * b / a : 1; }
const int dx[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0};
const int dy[9] = {1, -1, 0, 0, -1, 1, 1, -1, 0};
void solve()
{
    ll c, d;
    cin >> c >> d;
    ll gcF = 0, gcB = 0, lcFB = 1;
    for (int i = c; i <= d; i++)
    {
        string s;
        cin >> s;
        if (s == "Fizz")
        {
            gcF = gcd(gcF, i);
        }
        if (s == "Buzz")
        {
            gcB = gcd(gcB, i);
        }
        if (s == "FizzBuzz")
        {
            lcFB = lcm(lcFB, i);
        }
    }
    ll x = gcd(lcFB, gcF);
    ll y = gcd(lcFB, gcB);
    if (gcB == 0 and gcB == 0)
    {
        cout << d + 1 << " " << d + 1 << endl;
        return;
    }
    if (lcFB == 1)
    {
        cout << gcF << " " << gcB << endl;
        return;
    }
    if (gcF == 0 or gcB == 0)
    {
        ll ans = gcd(lcFB, gcd(gcF, gcB));
        cout << ans << " " << ans << endl;
        return;
    }
    // cout << gcF << " " << gcB << " " << lcFB << endl;
    cout << x << " " << y << endl;
    // ll a = gcF / x, b = gcB / y;
    // cout << a << " " << b << endl;
}
int main()
{
    IO;
    int TC = 1;
    // cin >> TC;
    while (TC--)
        solve();
}