// Marcin Knapik

#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;

// template <class T>ostream &operator<<(ostream &os, vector<T> &vec){for (T &el : vec){os << el << ' ';}return os;}
// template <class T>istream &operator>>(istream &is, vector<T> &vec) {for (T &el : vec){is >> el;}return is;}

// template <class T, class G> ostream &operator<<(ostream &os, pair<T, G> para) { os << para.f << ' ' << para.s; return os;}

using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vll = vector<ll>;
using vvpll = vector<vpll>;
using vii = vector<ii>;
using mp = map<vector<string>, long double>;
using ld = long double;


using cpx = complex<double>;
const double PI = acos(-1);
vector<cpx> roots = {{0, 0}, {1, 0}};

void ensure_capacity(int min_capacity) {
    for (int len = roots.size(); len < min_capacity; len *= 2) {
        for (int i = len >> 1; i < len; i++) {
            roots.emplace_back(roots[i]);
            double angle = 2 * PI * (2 * i + 1 - len) / (len * 2);
            roots.emplace_back(cos(angle), sin(angle));
        }
    }
}

void fft(vector<cpx> &z, bool inverse) {
    int n = z.size();
    assert((n & (n - 1)) == 0);
    ensure_capacity(n);
    for (int i = 1, j = 0; i < n; i++) {
        int bit = n >> 1;
        for (; j >= bit; bit >>= 1)
            j -= bit;
        j += bit;
        if (i < j)
            swap(z[i], z[j]);
    }
    for (int len = 1; len < n; len <<= 1) {
        for (int i = 0; i < n; i += len * 2) {
            for (int j = 0; j < len; j++) {
                cpx root = inverse ? conj(roots[j + len]) : roots[j + len];
                cpx u = z[i + j];
                cpx v = z[i + j + len] * root;
                z[i + j] = u + v;
                z[i + j + len] = u - v;
            }
        }
    }
    if (inverse)
        for (int i = 0; i < n; i++)
            z[i] /= n;
}

vector<int> multiply_bigint(const vector<int> &a, const vector<int> &b, int base) {
    int need = a.size() + b.size();
    int n = 1;
    while (n < need)
        n <<= 1;
    vector<cpx> p(n);
    for (size_t i = 0; i < (size_t)n; i++) {
        p[i] = cpx(i < a.size() ? a[i] : 0, i < b.size() ? b[i] : 0);
    }
    fft(p, false);
    // a[w[k]] = (p[w[k]] + conj(p[w[n-k]])) / 2
    // b[w[k]] = (p[w[k]] - conj(p[w[n-k]])) / (2*i)
    vector<cpx> ab(n);
    cpx r(0, -0.25);
    for (int i = 0; i < n; i++) {
        int j = (n - i) & (n - 1);
        ab[i] = (p[i] * p[i] - conj(p[j] * p[j])) * r;
    }
    fft(ab, true);
    vector<int> result(need);
    long long carry = 0;
    for (int i = 0; i < need; i++) {
        long long d = (long long)(ab[i].real() + 0.5) + carry;
        carry = d / base;
        result[i] = d % base;
    }
    return result;
}

vector<int> multiply_mod(const vector<int> &a, const vector<int> &b, int m) {
    int need = a.size() + b.size() - 1;
    int n = 1;
    while (n < need)
        n <<= 1;
    vector<cpx> A(n);
    for (size_t i = 0; i < a.size(); i++) {
        int x = (a[i] % m + m) % m;
        A[i] = cpx(x & ((1 << 15) - 1), x >> 15);
    }
    fft(A, false);

    vector<cpx> B(n);
    for (size_t i = 0; i < b.size(); i++) {
        int x = (b[i] % m + m) % m;
        B[i] = cpx(x & ((1 << 15) - 1), x >> 15);
    }
    fft(B, false);

    vector<cpx> fa(n);
    vector<cpx> fb(n);
    for (int i = 0, j = 0; i < n; i++, j = n - i) {
        cpx a1 = (A[i] + conj(A[j])) * cpx(0.5, 0);
        cpx a2 = (A[i] - conj(A[j])) * cpx(0, -0.5);
        cpx b1 = (B[i] + conj(B[j])) * cpx(0.5, 0);
        cpx b2 = (B[i] - conj(B[j])) * cpx(0, -0.5);
        fa[i] = a1 * b1 + a2 * b2 * cpx(0, 1);
        fb[i] = a1 * b2 + a2 * b1;
    }

    fft(fa, true);
    fft(fb, true);
    vector<int> res(need);
    for (int i = 0; i < need; i++) {
        long long aa = (long long)(fa[i].real() + 0.5);
        long long bb = (long long)(fb[i].real() + 0.5);
        long long cc = (long long)(fa[i].imag() + 0.5);
        res[i] = (aa % m + (bb % m << 15) + (cc % m << 30)) % m;
    }
    return res;
}

using namespace std;

constexpr int digits(int base) noexcept {
    return base <= 1 ? 0 : 1 + digits(base / 10);
}

constexpr int base = 1000'000'000;
constexpr int base_digits = digits(base);

constexpr int fft_base = 10'000;  // fft_base^2 * n / fft_base_digits <= 10^15 for double
constexpr int fft_base_digits = digits(fft_base);

struct bigint {
    // value == 0 is represented by empty z
    vector<int> z;  // digits

    // sign == 1 <==> value >= 0
    // sign == -1 <==> value < 0
    int sign;

    bigint(long long v = 0) { *this = v; }

    bigint &operator=(long long v) {
        sign = v < 0 ? -1 : 1;
        v *= sign;
        z.clear();
        for (; v > 0; v = v / base)
            z.push_back((int)(v % base));
        return *this;
    }

    bigint(const string &s) { read(s); }

    bigint &operator+=(const bigint &other) {
        if (sign == other.sign) {
            for (int i = 0, carry = 0; i < (int)other.z.size() || carry; ++i) {
                if (i == (int)z.size())
                    z.push_back(0);
                z[i] += carry + (i < (int)other.z.size() ? other.z[i] : 0);
                carry = z[i] >= base;
                if (carry)
                    z[i] -= base;
            }
        } else if (other != 0 /* prevent infinite loop */) {
            *this -= -other;
        }
        return *this;
    }

    friend bigint operator+(bigint a, const bigint &b) {
        a += b;
        return a;
    }

    bigint &operator-=(const bigint &other) {
        if (sign == other.sign) {
            if ((sign == 1 && *this >= other) || (sign == -1 && *this <= other)) {
                for (int i = 0, carry = 0; i < (int)other.z.size() || carry; ++i) {
                    z[i] -= carry + (i < (int)other.z.size() ? other.z[i] : 0);
                    carry = z[i] < 0;
                    if (carry)
                        z[i] += base;
                }
                trim();
            } else {
                *this = other - *this;
                this->sign = -this->sign;
            }
        } else {
            *this += -other;
        }
        return *this;
    }

    friend bigint operator-(bigint a, const bigint &b) {
        a -= b;
        return a;
    }

    bigint &operator*=(int v) {
        if (v < 0)
            sign = -sign, v = -v;
        for (int i = 0, carry = 0; i < (int)z.size() || carry; ++i) {
            if (i == (int)z.size())
                z.push_back(0);
            long long cur = (long long)z[i] * v + carry;
            carry = (int)(cur / base);
            z[i] = (int)(cur % base);
        }
        trim();
        return *this;
    }

    bigint operator*(int v) const { return bigint(*this) *= v; }

    friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
        int norm = base / (b1.z.back() + 1);
        bigint a = a1.abs() * norm;
        bigint b = b1.abs() * norm;
        bigint q, r;
        q.z.resize(a.z.size());

        for (int i = (int)a.z.size() - 1; i >= 0; i--) {
            r *= base;
            r += a.z[i];
            int s1 = b.z.size() < r.z.size() ? r.z[b.z.size()] : 0;
            int s2 = b.z.size() - 1 < r.z.size() ? r.z[b.z.size() - 1] : 0;
            int d = (int)(((long long)s1 * base + s2) / b.z.back());
            r -= b * d;
            while (r < 0)
                r += b, --d;
            q.z[i] = d;
        }

        q.sign = a1.sign * b1.sign;
        r.sign = a1.sign;
        q.trim();
        r.trim();
        return {q, r / norm};
    }

    friend bigint sqrt(const bigint &a1) {
        bigint a = a1;
        while (a.z.empty() || a.z.size() % 2 == 1)
            a.z.push_back(0);

        int n = a.z.size();

        int firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
        int norm = base / (firstDigit + 1);
        a *= norm;
        a *= norm;
        while (a.z.empty() || a.z.size() % 2 == 1)
            a.z.push_back(0);

        bigint r = (long long)a.z[n - 1] * base + a.z[n - 2];
        firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
        int q = firstDigit;
        bigint res;

        for (int j = n / 2 - 1; j >= 0; j--) {
            for (;; --q) {
                bigint r1 = (r - (res * 2 * base + q) * q) * base * base +
                            (j > 0 ? (long long)a.z[2 * j - 1] * base + a.z[2 * j - 2] : 0);
                if (r1 >= 0) {
                    r = r1;
                    break;
                }
            }
            res *= base;
            res += q;

            if (j > 0) {
                int d1 = res.z.size() + 2 < r.z.size() ? r.z[res.z.size() + 2] : 0;
                int d2 = res.z.size() + 1 < r.z.size() ? r.z[res.z.size() + 1] : 0;
                int d3 = res.z.size() < r.z.size() ? r.z[res.z.size()] : 0;
                q = (int)(((long long)d1 * base * base + (long long)d2 * base + d3) / (firstDigit * 2));
            }
        }

        res.trim();
        return res / norm;
    }

    bigint operator/(const bigint &v) const { return divmod(*this, v).first; }

    bigint operator%(const bigint &v) const { return divmod(*this, v).second; }

    bigint &operator/=(int v) {
        if (v < 0)
            sign = -sign, v = -v;
        for (int i = (int)z.size() - 1, rem = 0; i >= 0; --i) {
            long long cur = z[i] + rem * (long long)base;
            z[i] = (int)(cur / v);
            rem = (int)(cur % v);
        }
        trim();
        return *this;
    }

    bigint operator/(int v) const { return bigint(*this) /= v; }

    int operator%(int v) const {
        if (v < 0)
            v = -v;
        int m = 0;
        for (int i = (int)z.size() - 1; i >= 0; --i)
            m = (int)((z[i] + m * (long long)base) % v);
        return m * sign;
    }

    bigint &operator*=(const bigint &v) {
        *this = *this * v;
        return *this;
    }

    bigint &operator/=(const bigint &v) {
        *this = *this / v;
        return *this;
    }

    bigint &operator%=(const bigint &v) {
        *this = *this % v;
        return *this;
    }

    bool operator<(const bigint &v) const {
        if (sign != v.sign)
            return sign < v.sign;
        if (z.size() != v.z.size())
            return z.size() * sign < v.z.size() * v.sign;
        for (int i = (int)z.size() - 1; i >= 0; i--)
            if (z[i] != v.z[i])
                return z[i] * sign < v.z[i] * sign;
        return false;
    }

    bool operator>(const bigint &v) const { return v < *this; }

    bool operator<=(const bigint &v) const { return !(v < *this); }

    bool operator>=(const bigint &v) const { return !(*this < v); }

    bool operator==(const bigint &v) const { return sign == v.sign && z == v.z; }

    bool operator!=(const bigint &v) const { return !(*this == v); }

    void trim() {
        while (!z.empty() && z.back() == 0)
            z.pop_back();
        if (z.empty())
            sign = 1;
    }

    bool isZero() const { return z.empty(); }

    friend bigint operator-(bigint v) {
        if (!v.z.empty())
            v.sign = -v.sign;
        return v;
    }

    bigint abs() const { return sign == 1 ? *this : -*this; }

    long long longValue() const {
        long long res = 0;
        for (int i = (int)z.size() - 1; i >= 0; i--)
            res = res * base + z[i];
        return res * sign;
    }

    friend bigint gcd(const bigint &a, const bigint &b) { return b.isZero() ? a : gcd(b, a % b); }

    friend bigint lcm(const bigint &a, const bigint &b) { return a / gcd(a, b) * b; }

    void read(const string &s) {
        sign = 1;
        z.clear();
        int pos = 0;
        while (pos < (int)s.size() && (s[pos] == '-' || s[pos] == '+')) {
            if (s[pos] == '-')
                sign = -sign;
            ++pos;
        }
        for (int i = (int)s.size() - 1; i >= pos; i -= base_digits) {
            int x = 0;
            for (int j = max(pos, i - base_digits + 1); j <= i; j++)
                x = x * 10 + s[j] - '0';
            z.push_back(x);
        }
        trim();
    }

    friend istream &operator>>(istream &stream, bigint &v) {
        string s;
        stream >> s;
        v.read(s);
        return stream;
    }

    friend ostream &operator<<(ostream &stream, const bigint &v) {
        if (v.sign == -1)
            stream << '-';
        stream << (v.z.empty() ? 0 : v.z.back());
        for (int i = (int)v.z.size() - 2; i >= 0; --i)
            stream << setw(base_digits) << setfill('0') << v.z[i];
        return stream;
    }

    static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
        vector<long long> p(max(old_digits, new_digits) + 1);
        p[0] = 1;
        for (int i = 1; i < (int)p.size(); i++)
            p[i] = p[i - 1] * 10;
        vector<int> res;
        long long cur = 0;
        int cur_digits = 0;
        for (int v : a) {
            cur += v * p[cur_digits];
            cur_digits += old_digits;
            while (cur_digits >= new_digits) {
                res.push_back(int(cur % p[new_digits]));
                cur /= p[new_digits];
                cur_digits -= new_digits;
            }
        }
        res.push_back((int)cur);
        while (!res.empty() && res.back() == 0)
            res.pop_back();
        return res;
    }

    bigint operator*(const bigint &v) const {
        if (min(z.size(), v.z.size()) < 150)
            return mul_simple(v);
        bigint res;
        res.sign = sign * v.sign;
        res.z = multiply_bigint(convert_base(z, base_digits, fft_base_digits),
                                convert_base(v.z, base_digits, fft_base_digits), fft_base);
        res.z = convert_base(res.z, fft_base_digits, base_digits);
        res.trim();
        return res;
    }

    bigint mul_simple(const bigint &v) const {
        bigint res;
        res.sign = sign * v.sign;
        res.z.resize(z.size() + v.z.size());
        for (int i = 0; i < (int)z.size(); ++i)
            if (z[i])
                for (int j = 0, carry = 0; j < (int)v.z.size() || carry; ++j) {
                    long long cur = res.z[i + j] + (long long)z[i] * (j < (int)v.z.size() ? v.z[j] : 0) + carry;
                    carry = (int)(cur / base);
                    res.z[i + j] = (int)(cur % base);
                }
        res.trim();
        return res;
    }

    friend bigint abs(bigint x){
        return x < 0 ? -x : x;
    }
};

mt19937 rng(1);

bigint random_bigint(int n) {
    string s;
    for (int i = 0; i < n; i++) {
        s += uniform_int_distribution<int>('0', '9')(rng);
    }
    return bigint(s);
}

template<class T>
class Fraction{
public:
    Fraction() : a(0), b(1) {}
    Fraction(T x) : a(x), b(1) {}
    Fraction(const string &s1, const string &s2) : Fraction(T(s1), T(s2)) { }

    Fraction(T num, T den) : a(num), b(den) {
        T g = gcd(a, b);
        if (b < 0)
            g = -g;
        a /= g;
        b /= g;
    }

    Fraction& operator+=(Fraction const& other) {
        T g = gcd(b, other.b);
        a = a * (other.b / g) + (b / g) * other.a;
        b = b / g * other.b;
        return *this;
    }

    Fraction operator+(Fraction const& other) const {
        Fraction t = *this; t += other; return t;
    }

    Fraction& operator-=(Fraction const& other) {
        T g = gcd(b, other.b);
        a = a * (other.b / g) - (b / g) * other.a;
        b = b / g * other.b;
        return *this;
    }

    Fraction operator-(Fraction const& other) const {
        Fraction t = *this; t -= other; return t;
    }

    Fraction& operator*=(Fraction const& other) {
        T g1 = gcd(a, other.b);
        T g2 = gcd(b, other.a);
        a = (a / g1) * (other.a / g2);
        b = (b / g2) * (other.b / g1);
        return *this;
    }

    Fraction operator*(Fraction const& other) const {
        Fraction t = *this; t *= other; return t;
    }

    Fraction& operator/=(Fraction const& other) {
        *this *= Fraction(copy_sign(other.b, other.a), abs(other.a));
        return *this;
    }

    Fraction operator/(Fraction const& other) const {
        Fraction t = *this; t /= other; return t;
    }

    bool operator<(Fraction const& other) const {
        return a * other.b < other.a * b;
    }

    bool operator<=(Fraction const& other) const {
        return a * other.b <= other.a * b;
    }

    bool operator>(Fraction const& other) const {
        return a * other.b > other.a * b;
    }

    bool operator>=(Fraction const& other) const {
        return a * other.b >= other.a * b;
    }

    bool operator==(Fraction const& other) const {
        return a * other.b == other.a * b;
    }

    bool operator!=(Fraction const& other) const {
        return a * other.b != other.a * b;
    }

    T floor() const {
        return a / b;
    }

    // operator double() const {
    //     return (double)a / b;
    // }

    static T gcd(T a, T b) {
        a = abs(a);
        b = abs(b);
        while (b != 0) {
            a %= b;
            std::swap(a, b);
        }
        return a;
    }

    static T copy_sign(T a, T b) {
        return b >= 0 ? a : -a;
    }

    void norm(){
        if(a == 0){
            b = 1;
            return;
        }
        T GCD = gcd(a, b);
        a /= GCD;
        b /= GCD;
    }

    T a, b;
};

using bg = bigint;
using fll = Fraction<ll>;
using fbg = Fraction<bg>;


ostream & operator << (ostream&os, fll& frac){
    os << frac.a << "/" << frac.b;
    return os;
}

ostream & operator << (ostream&os, fbg& frac){
    os << frac.a << "/" << frac.b;
    return os;
}

int pytajniki(vector<string>& mapa){
    int ret = 0;
    for(auto & u : mapa){
        for(auto & v : u){
            ret += v == '?';
        }
    }
    return ret;
}


bool bounds(ii poz, int n, int m){
    return poz.f >= 0 and poz.s >= 0 and poz.f < n and poz.s < m;
}

int X[] {0, 0, -1, 1};
int Y[] {-1, 1, 0, 0};

vii neighs(ii poz, int n, int m){
    vii ret;
    FOR(i, 4){
        ii nowa = {poz.f + X[i], poz.s + Y[i]};
        if(bounds(nowa, n, m)){
            ret.pb(nowa);
        }
    }
    return ret;
}

void wypisz(vector<string>& mapa){
    for(auto & u : mapa){
        cout << u << '\n';
    }
    cout << endl;
}

fll memoize[1 << 16];
int hasz = 0;

fll solve(vector<string>& mapa, bool policzony_hasz){
    if(policzony_hasz){
        // wypisz(mapa);
        // cerr << "MEMOIZED ! " << memoize[hasz] << endl;
        // cerr << "HASZ " << hasz << ' ' << __builtin_popcount(hasz) << endl;
        
        return memoize[hasz];
    }

    int n = sz(mapa);
    int m = sz(mapa[0]);

    vector<vector<fll>> ile(n, vector<fll>(m));
    vvi active_neighs(n, vi(m));

    FOR(i, n){
        FOR(j, m){
            if(mapa[i][j] == 'O'){
                ile[i][j] = fll(1); 
            }
        }
    }

    while(true){
        bool active = false;
        fll mini;

        FOR(i, n){
            FOR(j, m){
                if(ile[i][j].a == 0)
                    continue;
                
                active_neighs[i][j] = 0;
                for(auto neigh : neighs({i, j}, n, m)){
                    active_neighs[i][j] += ile[neigh.f][neigh.s].a != 0;
                }
                if(active_neighs[i][j]){
                    if(active == false){
                        mini = ile[i][j] / fll(active_neighs[i][j]);
                        active = true;
                    } else {
                        mini = min(mini, ile[i][j] / fll(active_neighs[i][j]));
                    }
                }
            }
        }
        if(active){
            FOR(i, n){
                FOR(j, m){
                    if(ile[i][j].a != 0){
                        ile[i][j] -= mini * fll(active_neighs[i][j]);
                        ile[i][j].norm();
                    }
                }
            }
        } else {
            break;
        }
    }

    fll ret;
    FOR(i, n){
        FOR(j, m){
            ret += ile[i][j];
            ret.norm();
        }
    }

    // cout << "WYNIK  " << ret << endl;
    return ret;
}

fll solve_z_pytajnikami(vector<string>& mapa, int i, int j, bool licz_hasz){
    auto move_ij = [&](){
        if(j == sz(mapa[0]) - 1){
            j = 0;
            i ++;
        } else {
            j ++;
        }
    };

    ll hasz_przed = hasz;
    while(i < sz(mapa)){
        if(mapa[i][j] == '?'){
            mapa[i][j] = 'O';

            auto A = solve_z_pytajnikami(mapa, i, j, licz_hasz);
            mapa[i][j] = '.';

            auto B = solve_z_pytajnikami(mapa, i, j, licz_hasz);
            mapa[i][j] = '?';

            hasz = hasz_przed;

            fll ret = (A + B) / fll(2);
            ret.norm();
            return ret;
        } else {
            if(licz_hasz){
                if(mapa[i][j] == 'O'){
                    hasz += (1 << (i * 4 + j));
                }
            }
            move_ij();
        }
    }

    auto wynik = solve(mapa, licz_hasz); 
    hasz = hasz_przed;
    return wynik;
}

bool kratka(vector<string>& mapa){
    int n = sz(mapa);
    int m = sz(mapa[0]);

    FOR(i, n){
        FOR(j, m){
            if(i % 5 == 4 or j % 5 == 4){
                if(mapa[i][j] != '.')
                    return false;
            }
        }
    }
    return true;
}

void solve(){
    int n, m;
    cin >> n >> m;
    
    vector<string> mapa(n);
    FOR(i, n){
        cin >> mapa[i];
    }

    if(pytajniki(mapa) == 0){
        fll wynik = solve(mapa, false);
        cout << wynik << '\n';
    } else if (pytajniki(mapa) <= 5){
        fll wynik = solve_z_pytajnikami(mapa, 0, 0, false);
        cout << wynik << '\n';
    } else if (kratka(mapa)){
        // zakladam, że mam g6
        vector<string> temp = {
            "xxxx",
            "xxxx",
            "xxxx",
            "xxxx",
        };

        for(int mask = 0; mask < (1 << 16); mask++){
            FOR(i, 4){
                FOR(j, 4){
                    if(mask & (1 << (i * 4 + j))){
                        temp[i][j] = 'O';
                    } else {
                        temp[i][j] = '.';
                    }
                }
            }
            memoize[mask] = solve(temp, false);
        }

        fll wynik;
        map<vector<string>, fll> opcik;


        for(int i = 0; i < n; i += 5){
            for(int j = 0; j < m; j += 5){
                int x = min(4, n - i);
                int y = min(4, m - j);
                
                vector<string> teraz(x, string('#', y));
                FOR(I, x){
                    FOR(J, y){
                        teraz[I][J] = mapa[i + I][j + J]; 
                    }
                }
                if(opcik.count(teraz) == 0){
                    opcik[teraz] = solve_z_pytajnikami(teraz, 0, 0, x == 4 and y == 4);
                }

                wynik += opcik[teraz];
                wynik.norm();

                assert(hasz == 0);
            }
        }

        cout << wynik << '\n';
    } else if (n == 1) {
        mapa[0] = "." + mapa[0] + '.';
        m += 2;

        Fraction<bg> suma_dobrych;

        vector<bg> spos_pref(m);
        vector<bg> spos_suf(m);
        
        spos_pref[0] = 1;
        for(int i = 1; i < m; i++){
            spos_pref[i] = spos_pref[i - 1] * (mapa[0][i] == '?' ? 2 : 1); 
        }

        spos_suf[m - 1] = 1;
        for(int i = m - 2; i >= 0; i--){
            spos_suf[i] = spos_suf[i + 1] * (mapa[0][i] == '?' ? 2 : 1);
        }
        assert(spos_pref.back() == spos_suf[0]);

        auto pustable = [](char c){
            return c == '.' or c == '?';
        };

        auto pelnable = [](char c){
            return c == 'O' or c == '?';
        };

        for(int j = 0; j < m - 1; j++){
            if(pustable(mapa[0][j]) and pelnable(mapa[0][j + 1])){
                suma_dobrych += (j == 0 ? 1 : spos_pref[j - 1]) * (j == m - 2 ? 1 : spos_suf[j + 2]);  
            }
            if(pelnable(mapa[0][j]) and pustable(mapa[0][j + 1])){
                suma_dobrych += (j == 0 ? 1 : spos_pref[j - 1]) * (j == m - 2 ? 1 : spos_suf[j + 2]);  
            }
        }

        for(int j = 0; j < m - 3; j++){
            if(pustable(mapa[0][j]) and pelnable(mapa[0][j + 1]) and pelnable(mapa[0][j + 2]) and pustable(mapa[0][j + 3])){
                suma_dobrych -= (j == 0 ? 1 : spos_pref[j - 1]) * (j == m - 4 ? 1 : spos_suf[j + 4]) * 2;
            }
        }

        Fraction<bg> licznik(suma_dobrych);
        Fraction<bg> mianownik(spos_suf[0]);
        auto wynik = (licznik / mianownik) / Fraction<bg>(2);
        wynik.norm();
        cout << wynik << '\n';
    } else {
        fll wynik = solve_z_pytajnikami(mapa, 0, 0, false);
        cout << wynik << '\n';
    }
}

int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; test++) {
        solve();
    }

    return 0;
}