Problem: Take the'IOI'train

A new railway has been laid in IOI. Trains running on railways in IOI are a combination of several vehicles, and there are two types of vehicles, I and O. Vehicles can only be connected to different types of vehicles. Also, because the train has a driver's seat, the cars at both ends of the train must be of type I. A train is represented by a character string in which characters indicating the type of vehicle are connected in order, and the length of the train is assumed to be the length of the character string. For example, if vehicles are connected in the order of IOIOI, a train with a length of 5 can be formed, and vehicle I is a train with a length of 1 alone. Trains cannot be formed by arranging vehicles in the order of OIOI or IOOI.

Some vehicles are stored in two garages. Vehicles are lined up in a row in each garage. When forming a train, take out the train from the garage and connect it in front of the garage. Only the vehicle closest to the entrance of the garage can be taken out of the garage, but the order of taking out the vehicle from which garage is arbitrary.

Before forming a train, you can take as many cars out of the garage as you like and move them to another waiting rail. Vehicles that have been moved to the standby rails cannot be used to organize trains in the future. Also, once the train formation is started, the vehicle cannot be moved from the garage to the standby rail until the formation is completed.

When organizing a train, it is not necessary to use up all the cars in the garage. That is, after the train formation is completed, unused cars may remain in the garage.

It is believed that there are so many people on the railroad in IOI, so I want to organize the longest possible train.

<image>


Figure: The train is being organized, and the vehicle in the garage cannot be moved to the standby rail at this time. This figure corresponds to I / O example 1.

Task

Create a program to find the maximum length of trains that can be organized given the information of the cars stored in the garage. The row of vehicles stored in each garage is represented by a string consisting of only two types of letters I and O, and the information in the two garages is represented by the string S of length M and the string T of length N, respectively. Given. Each letter represents one vehicle, the letter of which is the same as the type of vehicle. The first letter of the string represents the vehicle closest to the entrance to the garage, and the last letter represents the vehicle closest to the garage.

Limits

* 1 ≤ M ≤ 2000 Length of string S
* 1 ≤ N ≤ 2000 Length of string T



input

Read the following data from standard input.

* In the first line, M and N are written separated by blanks.
* The character string S is written on the second line.
* The character string T is written on the third line.



output

Output an integer representing the maximum train length that can be organized to the standard output on one line. If no train can be organized, output 0.

Input / output example

Input example 1


5 5
OIOOI
OOIOI


Output example 1


7


Let the garage represented by S be the garage S and the garage represented by T be the garage T. At this time, for example, the first vehicle from the garage S, the first two vehicles from the garage T are put out and put on standby, and then the garage S, the garage S, the garage T, the garage S, the garage S, the garage T, and the garage T are placed in this order. If you take out the vehicle, you can form a train IOIOIOI with a length of 7.

In addition, after the first vehicle from garage S and the first two vehicles from garage T are put out and put on standby, the order is garage T, garage T, garage S, garage S, garage T, garage S, and garage S. You can also organize a 7-length train by putting out a vehicle. Since it is not possible to form a train longer than this, 7 is output.




Input example 2


5 9
IIIII
IIIIIIIII


Output example 2


1


Note that train I, which consists of only one car, also meets the conditions for a train.

The question text and the data used for the automatic referee are the question text and the test data for scoring, which are created and published by the Japan Committee for Information Olympics.





Example

Input

5 5
OIOOI
OOIOI


Output

7

Solution (in CPP):

Solution:
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>

using namespace std;
#define int long long int
const int INF = 1001001001001001LL;

int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

signed main(){
    
    int n, m; cin >> n >> m;
    vector<vector<vector<int> > > dp(n + 1, vector<vector<int> > (m + 1, vector<int> (2, -1)));
    dp[0][0][0] = 0LL;

    string s; cin >> s;
    string t; cin >> t;
    
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= m; j++){
            for(int k = 0; k < 2; k++){
                if(dp[i][j][k] == -1) continue;

                if(k == 0){
                    // 次に欲しいのは 1
                    if(i != n){
                    if(s[i] == 'I') dp[i + 1][j][1] = max(dp[i + 1][j][1], dp[i][j][k] + 1);
                    else dp[i + 1][j][0] = max(dp[i + 1][j][0], 0LL);
                    }

                    if(j != m){
                    if(t[j] == 'I') dp[i][j + 1][1] = max(dp[i][j + 1][1], dp[i][j][k] + 1);
                    else dp[i][j + 1][0] = max(dp[i][j + 1][0], 0LL);
                    }
                }else{
                    // 次に欲しいのは 0
                    
                    if(i != n){
                    if(s[i] == 'O') dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k] + 1);
                    else dp[i + 1][j][0] = max(dp[i + 1][j][0], 0LL);
                    }

                    if(j != m){
                    if(t[j] == 'O') dp[i][j + 1][0] = max(dp[i][j + 1][0], dp[i][j][k] + 1);
                    else dp[i][j + 1][0] = max(dp[i][j + 1][0], 0LL);
                    }
                }
            }
        }
    }

    int ans = 0;
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= m; j++){
            ans = max(ans, dp[i][j][1]);
        }
    }
    
    /*
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= m; j++){
            cout << i << " " << j << " " <<  dp[i][j][0] << " " << dp[i][j][1] << endl;
        }
    }
    */
    cout << ans << endl;
        
    return 0;
}