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
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template <typename A, typename B>
using unordered_map2 = __gnu_pbds::gp_hash_table<A, B>;
using namespace __gnu_pbds;
template <typename T> using ordered_set =
  __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
                   __gnu_pbds::tree_order_statistics_node_update>;
// ordered_set<int> s; s.insert(1); s.insert(2);
// s.order_of_key(1);    // Out: 0.
// *s.find_by_order(1);  // Out: 2.

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, ll b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

constexpr int MaxWspMaski = 5;
constexpr int MaxBokMaski = 11;
constexpr int MaxPolaWMasce = 30;
constexpr int BitsetSize = 121;

static_assert(MaxBokMaski == MaxWspMaski * 2 + 1);
static_assert(BitsetSize == MaxBokMaski * MaxBokMaski);

struct Maska {
  int wartosc;
  vector<pair<pair<int, int>, int>> pola;

  bitset<BitsetSize> zera, jedynki, pelna;

  int ile_pytan[MaxPolaWMasce + 1];
  bool mam_przeliczyc;
};

int Zakoduj(int dx, int dy) {
  assert(-MaxWspMaski <= dx and dx <= MaxWspMaski);
  assert(-MaxWspMaski <= dy and dy <= MaxWspMaski);
  const int result = (dx + MaxWspMaski) * MaxBokMaski + (dy + MaxWspMaski);
  assert(0 <= result and result < MaxBokMaski * MaxBokMaski);
  return result;
}

vector<Maska> niezerowe_maski;

constexpr int nax = 205;
int hej[nax][nax];

void Zadanie() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      char c;
      cin >> c;
      if (c == 'O') {
        hej[i][j] = 1;
      } else if (c == '.') {
        hej[i][j] = 0;
      } else if (c == '?') {
        hej[i][j] = 2;
      } else {
        assert(false);
      }
    }
  }


  for (Maska& maska : niezerowe_maski) {
    assert((int) maska.pola.size() <= MaxPolaWMasce);
    maska.zera.reset();
    maska.jedynki.reset();
    for (int i = 0; i <= MaxPolaWMasce; i++) {
      maska.ile_pytan[i] = 0;
    }
    for (const auto& [dxy, co] : maska.pola) {
      const auto& [dx, dy] = dxy;
      assert(-MaxWspMaski <= dx and dx <= MaxWspMaski);
      assert(-MaxWspMaski <= dy and dy <= MaxWspMaski);
      if (co == 0) {
        maska.zera[Zakoduj(dx, dy)] = 1;
      } else if (co == 1) {
        maska.jedynki[Zakoduj(dx, dy)] = 1;
      } else {
        assert(false);
      }
    }
    maska.pelna = maska.zera | maska.jedynki;
  }

  sort(niezerowe_maski.begin(), niezerowe_maski.end(), [](const Maska& a, const Maska& b) -> bool {
    for (int i = 0; i < BitsetSize; i++) {
      if (a.pelna[i] != b.pelna[i]) {
        return a.pelna[i] < b.pelna[i];
      }
    }
    return false;
  });

  for (int i = 0; i < (int) niezerowe_maski.size(); i++) {
    if (i == 0 or niezerowe_maski[i - 1].pelna != niezerowe_maski[i].pelna) {
      niezerowe_maski[i].mam_przeliczyc = true;
    } else {
      niezerowe_maski[i].mam_przeliczyc = false;
    }
  }

  bitset<BitsetSize> jedynki, zera, pytania;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      jedynki.reset();
      zera.reset();
      pytania.reset();
      for (int dx = -MaxWspMaski; dx <= MaxWspMaski; dx++) {
        for (int dy = -MaxWspMaski; dy <= MaxWspMaski; dy++) {
          const int x = i + dx;
          const int y = j + dy;
          if (0 <= x and x < n and 0 <= y and y < m) {
            if (hej[x][y] == 0) {
              zera[Zakoduj(dx, dy)] = 1;
            } else if (hej[x][y] == 1) {
              jedynki[Zakoduj(dx, dy)] = 1;
            } else if (hej[x][y] == 2) {
              pytania[Zakoduj(dx, dy)] = 1;
            } else {
              assert(false);
            }
          } else {
            zera[Zakoduj(dx, dy)] = 1;
          }
        }
      }

      int ost_ile_pytan = 0;
      for (Maska& maska : niezerowe_maski) {
        if (maska.mam_przeliczyc) {
          ost_ile_pytan = (pytania & maska.pelna).count();
        }
        if ((jedynki & maska.zera).any()) continue;
        if ((zera & maska.jedynki).any()) continue;
        const int ile_pytan = ost_ile_pytan;
        assert(0 <= ile_pytan and ile_pytan <= MaxPolaWMasce);
        maska.ile_pytan[ile_pytan]++;
      }
    }
  }

  ll licznik = 0;
  for (const Maska& maska : niezerowe_maski) {
    for (int i = 0; i <= MaxPolaWMasce; i++) {
      assert(0 <= maska.wartosc and maska.wartosc <= 24);
      licznik += maska.wartosc * (1ll << (MaxPolaWMasce - i)) * maska.ile_pytan[i];
    }
  }

  ll mianownik = 24 * (1ll << MaxPolaWMasce);

  const ll g = __gcd(licznik, mianownik);

  licznik /= g;
  mianownik /= g;

  cout << licznik << "/" << mianownik << endl;
}

struct Pole {
  int co;

  int min_zostalo, max_zostalo;
  pair<int, int> szkodnik;
  int min_stopien, max_stopien;
};

constexpr int Size = 11;

Pole tab[Size][Size];
constexpr int start_x = Size / 2;
constexpr int start_y = Size / 2;

void Iteracja(int czas) {
  for (int i = 0; i < Size; i++) {
    for (int j = 0; j < Size; j++) {
      if (tab[i][j].max_zostalo == 0) continue;
      if (tab[i][j].co == 2) continue;
      tab[i][j].min_stopien = 0;
      tab[i][j].max_stopien = 0;
      constexpr int dx[4] = {-1, 0, 1, 0};
      constexpr int dy[4] = {0, -1, 0, 1};
      for (int k = 0; k < 4; k++) {
        const int ii = i + dx[k];
        const int jj = j + dy[k];
        const bool dobry = (0 <= ii and ii < Size and 0 <= jj and jj < Size);
        const int mn = (dobry ? tab[ii][jj].min_zostalo : 0);
        const int mx = (dobry ? tab[ii][jj].max_zostalo : 24);
        if (mn != mx) {
          if (tab[i][j].szkodnik.first == -1) {
            assert(dobry);
            tab[i][j].szkodnik = {ii, jj};
          }
        }
        if (mn > 0) {
          tab[i][j].min_stopien++;
          tab[i][j].max_stopien++;
        } else if (mx > 0) {
          tab[i][j].max_stopien++;
        }
      }
    }
  }

  assert(czas > 0);

  for (int i = 0; i < Size; i++) {
    for (int j = 0; j < Size; j++) {
      if (tab[i][j].co == 2) continue;
      if (tab[i][j].max_zostalo == 0) continue;
      tab[i][j].min_zostalo -= czas * tab[i][j].max_stopien;
      tab[i][j].max_zostalo -= czas * tab[i][j].min_stopien;
      if (tab[i][j].min_zostalo < 0) {
        tab[i][j].min_zostalo = 0;
      }
      assert(tab[i][j].min_zostalo >= 0);
      assert(tab[i][j].max_zostalo >= tab[i][j].min_zostalo);
    }
  }
}

const vector<int> dlugosci_faz = {6, 2, 1, 1, 2, 2, 1, 1, 2, 6};

void Baktracz(int depth) {
  for (int i = 0; i < Size; i++) {
    for (int j = 0; j < Size; j++) {
      if (tab[i][j].co == 0) {
        tab[i][j].min_zostalo = tab[i][j].max_zostalo = 0;
        tab[i][j].szkodnik = {-1, -1};
      } else if (tab[i][j].co == 1) {
        tab[i][j].min_zostalo = tab[i][j].max_zostalo = 24;
        tab[i][j].szkodnik = {-1, -1};
      } else if (tab[i][j].co == 2) {
        tab[i][j].min_zostalo = 0;
        tab[i][j].max_zostalo = 24;
        tab[i][j].szkodnik = {i, j};
      }
    }
  }
  for (const int dl : dlugosci_faz) {
    Iteracja(dl);
  }
  if (tab[start_x][start_y].min_zostalo == tab[start_x][start_y].max_zostalo) {
    if (tab[start_x][start_y].min_zostalo > 0) {
      Maska maska;
      maska.wartosc = tab[start_x][start_y].min_zostalo;
      for (int i = 0; i < Size; i++) {
        for (int j = 0; j < Size; j++) {
          if (tab[i][j].co == 0 or tab[i][j].co == 1) {
            maska.pola.emplace_back(make_pair(i - start_x, j - start_y), tab[i][j].co);
          }
        }
      }
      niezerowe_maski.push_back(maska);
    }
    return;
  }
  int x = tab[start_x][start_y].szkodnik.first;
  int y = tab[start_x][start_y].szkodnik.second;
  assert(0 <= x and x < Size);
  assert(0 <= y and y < Size);
  while (tab[x][y].co != 2) {
    const int nx = tab[x][y].szkodnik.first;
    const int ny = tab[x][y].szkodnik.second;
    x = nx;
    y = ny;
  }
  assert(tab[x][y].co == 2);
  tab[x][y].co = 0;
  Baktracz(depth + 1);
  tab[x][y].co = 1;
  Baktracz(depth + 1);
  tab[x][y].co = 2;
}

void Preprocessing() {
  for (int i = 0; i < Size; i++) {
    for (int j = 0; j < Size; j++) {
      tab[i][j].co = 2;
    }
  }
  tab[start_x][start_y].co = 1;
  Baktracz(1);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  Preprocessing();
  Zadanie();

  return 0;
}