#include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = int(s); i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define dforsn(i, s, n) for (int i = int(n) - 1; i >= int(s); i--)
#define dforn(i, n) dforsn(i, 0, n)
#define qforn(i, n) for (i = 0; i < n; i++)
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
vector<string> s(n);
forn(i, n) cin >> s[i];
char pat00, pat01, pat10, pat11;
cin >> pat00 >> pat01 >> pat10 >> pat11;
auto check = [&](int i, int j) {
if (i < 0 || i + 1 >= n || j < 0 || j + 1 >= m) return 0;
if (s[i][j] != pat00) return 0;
if (s[i][j + 1] != pat01) return 0;
if (s[i + 1][j] != pat10) return 0;
if (s[i + 1][j + 1] != pat11) return 0;
return 1;
};
int curr = 0;
forn(i, n) forn(j, m) curr += check(i, j);
int ret = curr;
forn(i, n) forn(j, m) {
char prevLetter = s[i][j];
int prevCnt = curr;
string t = "JOI";
for (char c : t) {
curr -= check(i, j);
curr -= check(i, j - 1);
curr -= check(i - 1, j);
curr -= check(i - 1, j - 1);
s[i][j] = c;
curr += check(i, j);
curr += check(i, j - 1);
curr += check(i - 1, j);
curr += check(i - 1, j - 1);
ret = max(ret, curr);
}
s[i][j] = prevLetter;
curr = prevCnt;
}
cout << ret << "\n";
return 0;
}
