#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    assert(1 <= k and k <= n and n <= 100000);
    if (n == 1)
    {
        cout << "1/1" << endl;
        return 0;
    }
    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a.at(i);
        assert(1 <= a.at(i) and a.at(i) <= 10);
    }
    const int root = 2520 * 2520;
    vector<int> d(n - 1);
    for (int i = 0; i < n - 1; i++)
    {
        d.at(i) = root / (a.at(i) * a.at(i + 1));
    }
    int64_t p = accumulate(d.begin(), d.begin() + k - 1, int64_t()), q = accumulate(d.begin(), d.end(), int64_t());
    int64_t g = gcd(p, q);
    p /= g;
    q /= g;
    int64_t qcopy = q, maxprime = 1;
    for (int64_t i = 2; i * i <= qcopy; i++) {
        while (qcopy % i == 0) {
            qcopy /= i;
        }
        maxprime = max(maxprime, i);
    }
    maxprime = max(maxprime, qcopy);
    assert(maxprime < 998244353);
    if (p == 0)
    {
        cout << 0 << endl;
    }
    else
    {
        cout << p << '/' << q << endl;
    }
    return 0;
}