Problem: Problem E Black or White

Here lies a row of a number of bricks each painted either black or white. With a single stroke of your brush, you can overpaint a part of the row of bricks at once with either black or white paint. Using white paint, all the black bricks in the painted part become white while originally white bricks remain white; with black paint, white bricks become black and black ones remain black. The number of bricks painted in one stroke, however, is limited because your brush cannot hold too much paint at a time. For each brush stroke, you can paint any part of the row with any number of bricks up to the limit.

In the first case of the sample input, the initial colors of four bricks are black, white, white, and black. You can repaint them to white, black, black, and white with two strokes: the first stroke paints all four bricks white and the second stroke paints two bricks in the middle black.

Your task is to calculate the minimum number of brush strokes needed to change the brick colors as specified. Never mind the cost of the paints.

Input

The input consists of a single test case formatted as follows.



$n$ $k$
$s$
$t$


The first line contains two integers $n$ and $k$ ($1 \leq k \leq n \leq 500 000$). $n$ is the number of bricks in the row and $k$ is the maximum number of bricks painted in a single stroke. The second line contains a string $s$ of $n$ characters, which indicates the initial colors of the bricks. The third line contains another string $t$ of $n$ characters, which indicates the desired colors of the bricks. All the characters in both s and t are either B or W meaning black and white, respectively.

Output

Output the minimum number of brush strokes required to repaint the bricks into the desired colors.

Sample Input 1


4 4
BWWB
WBBW


Sample Output 1


2


Sample Input 2


4 3
BWWB
WBBW


Sample Output 2


3


Sample Input 3


4 3
BWWW
BWWW


Sample Output 3


0


Sample Input 4


7 1
BBWBWBW
WBBWWBB


Sample Output 4


4






Example

Input

4 4
BWWB
WBBW


Output

2

Solution (in CPP):

Solution:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
//dp[i]:前i个位置染完的最小花费
//dp[0] = 0, dp[others] = INF
//if(a[i] == b[i]) dp[i] = dp[i-1]
//else dp[i] = min{dp[j] + cost(j+1, i)|max(0, i-k) <= j < i}
//cost(x, y):ceil((sum[i]-sum[j+1])/2)+1=(sum[i]-sum[j+1]+1)/2+1
//dp[i]=min{(2*dp[j]-sum[j+1]+sum[i]+3)/2|max(0, i-k) <= j < i}
//f[j] = 2*dp[j] - sum[j+1]//用长度为k的单调队列维护
//dp[i]=min{(f[j]+sum[i]+3)/2}
//f[i] = 2*dp[i]-sum[i+1]入队
const int maxn =  5e5 + 10;
const int INF = 0x3f3f3f3f;
int n, k;
char s[maxn], t[maxn];
int sum[maxn];
int dp[maxn];
struct Queue {
    struct Node {
        int pos, val;
    }node[maxn];
    int l, r;
    void init() { l = 1, r = 0; }
    void update(int pos, int val) {
        while (l <= r && val < node[r].val) r--;
        node[++r] = Node{pos, val};
        while (l <= r && node[r].pos - node[l].pos >= k) l++;
    }
    int query() {
        if (l > r) return INF;
        return node[l].val;
    }
}que;
int main() {
    scanf("%d%d", &n, &k);
    scanf("%s%s", s+1, t+1);
    sum[0] = 0, t[0] = '#';
    for (int i = 1; i <= n; i++) sum[i] = sum[i-1] + (t[i] != t[i-1]);
    dp[0] = 0;
    que.init();
    que.update(0, 2*dp[0]-sum[1]);
    for (int i = 1; i <= n; i++) {
        dp[i] = INF;
        if (s[i] == t[i]) dp[i] = dp[i-1];
        else {
            //cout << i << ":" << que.query() << endl;
            dp[i] = min(dp[i], (que.query()+sum[i]+3)/2);
        }
        que.update(i, 2*dp[i]-sum[i+1]);
        //cout << dp[i] << "test" << endl;
    }
    printf("%d\n", dp[n]);
    return 0;
}