#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int c, d;
    cin >> c >> d;
    int a = 5e5, b = 5e6;
    int ga = 0, gb = 0;
    vector<int> fizz, buzz;
    for(int i = c; i <= d; ++i)
    {
        string s;
        cin >> s;
        int cnt = 0;
        if(s.find("Fizz") != -1)
            ga = __gcd(ga, i);
        else fizz.push_back(i);
        if(s.find("Buzz") != -1)
            gb = __gcd(gb, i);
        else buzz.push_back(i);
    }
    for(int i = 1; i <= max(ga, gb); ++i)
    {
        if(ga % i == 0 && (a > 1e5))
        {
            int f = 1;
            for(int j = 0; j < fizz.size(); ++j)
            {
                if(fizz[j] % i == 0)
                    f = 0;
            }
            if(f)
            {
                a = i;
                // break;
            }

        }
        if(gb % i == 0 && (b > 1e5))
        {
            int f = 1;
            for(int j = 0; j < buzz.size(); ++j)
            {
                if(buzz[j] % i == 0)
                    f = 0;
            }
            if(f)
            {
                b = i;
                //break;
            }

        }
    }
    cout << a << " " << b << endl;
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}