#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int H,W; cin >> H >> W;
	V<string> S(H+2),T(2);
	for(int i = 0; i < W+2; ++i) S[0].push_back('.');
	for(int i = 1; i <= H; ++i) {
		cin >> S[i];
		S[i] = "."+S[i]+".";
	}
	for(int i = 0; i < W+2; ++i) S[H+1].push_back('.');
	
	cin >> T[0];
	cin >> T[1];

	int sum = 0;
	for(int i = 0; i < H+1; ++i){
		for(int j = 0; j < W+1; ++j){
			int flg = 1;
			for(int k = 0; k < 2; ++k){
				for(int l = 0; l < 2; ++l){
					if(S[i+k][j+l]!=T[k][l]) flg = 0;
				}
			}
			sum += flg;
		}
	}

	int ans = sum;
	for(int i = 1; i <= H; ++i){
		for(int j = 1; j <= W; ++j){
			int flg,cnt1 = 0,cnt2 = 0;

			flg = 1;
			for(int k = 0; k < 2; ++k){
				for(int l = 0; l < 2; ++l){
					if(S[i-1+k][j-1+l]!=T[k][l]) flg = 0;
				}
			}
			cnt1 += flg;

			flg = 1;
			for(int k = 0; k < 2; ++k){
				for(int l = 0; l < 2; ++l){
					if(S[i-1+k][j+l]!=T[k][l]) flg = 0;
				}
			}
			cnt1 += flg;

			flg = 1;
			for(int k = 0; k < 2; ++k){
				for(int l = 0; l < 2; ++l){
					if(S[i+k][j-1+l]!=T[k][l]) flg = 0;
				}
			}
			cnt1 += flg;

			flg = 1;
			for(int k = 0; k < 2; ++k){
				for(int l = 0; l < 2; ++l){
					if(S[i+k][j+l]!=T[k][l]) flg = 0;
				}
			}
			cnt1 += flg;

			char org = S[i][j];
			string U = "JOI";
			
			for(int n = 0; n < 3; ++n){
				S[i][j] = U[n];
				cnt2 = 0;

				flg = 1;
				for(int k = 0; k < 2; ++k){
					for(int l = 0; l < 2; ++l){
						if(S[i-1+k][j-1+l]!=T[k][l]) flg = 0;
					}
				}
				cnt2 += flg;

				flg = 1;
				for(int k = 0; k < 2; ++k){
					for(int l = 0; l < 2; ++l){
						if(S[i-1+k][j+l]!=T[k][l]) flg = 0;
					}
				}
				cnt2 += flg;

				flg = 1;
				for(int k = 0; k < 2; ++k){
					for(int l = 0; l < 2; ++l){
						if(S[i+k][j-1+l]!=T[k][l]) flg = 0;
					}
				}
				cnt2 += flg;

				flg = 1;
				for(int k = 0; k < 2; ++k){
					for(int l = 0; l < 2; ++l){
						if(S[i+k][j+l]!=T[k][l]) flg = 0;
					}
				}
				cnt2 += flg;

				chmax(ans,sum-cnt1+cnt2);
			}
			S[i][j] = org;
		}
	}
	cout << ans << endl;

	return 0;
}



Measured memory_bytes: 5044