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

//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)

//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
//const------------------------------------------------------------------------------------------------------------------------
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
//global-----------------------------------------------------------------------------------------------------------------------
VS a;
string str;
VS eb;
int default_ans = 0;
int diff_max = 0;
int diff;
char b[1000];
string joi = "JOI";
int n, m;
//#define DEBUG
//function-------------------------------------------------------------------------------------------------------------------
int main() {
	scanf( "%d %d", &n, &m );
	rep( i, m + 2 ) {
		str += "?";
	}
	a.PB( str );
	rep( i, n ) {
		scanf( "%s", b );
		a.PB( "?" + ( string ) b + "?" );
	}
	a.PB( str );
	rep( i, 2 ) {
		scanf( "%s", b );
		eb.PB( ( string ) b );
	}
	FOR( i,0, a.size() - 2 ) {
		FOR( j, 0, a[0].size() - 2 ) {
			if ( a[ i + 1 ][ j + 1 ] == eb[ 0 ][ 0 ] && a[ i + 2 ][ j + 1 ] == eb[ 1 ][ 0 ] && a[ i + 1 ][ j + 2 ] == eb[ 0 ][ 1 ] && a[ i + 2 ][ j + 2 ] == eb[ 1 ][ 1 ] ) {
				default_ans++;
			}
		}
	}
	rep( i, 3 ) {
		FOR( j, 1, a.size() - 1 ) {
			FOR( k, 1, a[0].size() - 1) {
				diff = 0;
				if ( joi[ i ] == a[ j ][ k ] ) {
					continue;
				}
				if ( a[ j - 1 ][ k - 1 ] == eb[ 0 ][ 0 ] && a[ j ][ k - 1 ] == eb[ 1 ][ 0 ] && a[ j - 1 ][ k ] == eb[ 0 ][ 1 ] ) {
					if ( joi[ i ] == eb[ 1 ][ 1 ] ) {
						diff++;
					}
					if ( a[ j ][ k ] == eb[ 1 ][ 1 ] ) {
						diff--;
					}
				}
				if ( a[ j ][ k - 1 ] == eb[ 0 ][ 0 ] && a[ j + 1 ][ k - 1 ] == eb[ 1 ][ 0 ] && a[ j + 1 ][ k ] == eb[ 1 ][ 1 ] ) {
					if ( joi[ i ] == eb[ 0 ][ 1 ] ) {
						diff++;
					}
					if ( a[ j ][ k ] == eb[ 0 ][ 1 ] ) {
						diff--;
					}
				}
				if ( a[ j - 1 ][ k ] == eb[ 0 ][ 0 ] && a[ j ][ k + 1 ] == eb[ 1 ][ 1 ] && a[ j - 1 ][ k + 1 ] == eb[ 0 ][ 1 ] ) {
					if ( joi[ i ] == eb[ 1 ][ 0 ] ) {
						diff++;
					}
					if ( a[ j ][ k ] == eb[ 1 ][ 0 ] ) {
						diff--;
					}
				}
				if ( a[ j + 1 ][ k + 1 ] == eb[ 1 ][ 1 ] && a[ j ][ k + 1 ] == eb[ 0 ][ 1 ] && a[ j + 1 ][ k ] == eb[ 1 ][ 0 ] ) {
					if ( joi[ i ] == eb[ 0 ][ 0 ] ) {
						diff++;
					}
					if ( a[ j ][ k ] == eb[ 0 ][ 0 ] ) {
						diff--;
					}
				}
				diff_max = max( diff, diff_max );
			}
		}
	}
	printf( "%d\n", default_ans + diff_max );
	return 0;
}

Measured memory_bytes: 3116