Problem: You are given two strings s and t consisting of lowercase Latin letters. The length of t is 2 (i.e. this string consists only of two characters).

In one move, you can choose any character of s and replace it with any lowercase Latin letter. More formally, you choose some i and replace s_i (the character at the position i) with some character from 'a' to 'z'.

You want to do no more than k replacements in such a way that maximizes the number of occurrences of t in s as a subsequence.

Recall that a subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.

Input

The first line of the input contains two integers n and k (2 ≤ n ≤ 200; 0 ≤ k ≤ n) — the length of s and the maximum number of moves you can make. The second line of the input contains the string s consisting of n lowercase Latin letters. The third line of the input contains the string t consisting of two lowercase Latin letters.

Output

Print one integer — the maximum possible number of occurrences of t in s as a subsequence if you replace no more than k characters in s optimally.

Examples

Input


4 2
bbaa
ab


Output


3


Input


7 3
asddsaf
sd


Output


10


Input


15 6
qwertyhgfdsazxc
qa


Output


16


Input


7 2
abacaba
aa


Output


15

Note

In the first example, you can obtain the string "abab" replacing s_1 with 'a' and s_4 with 'b'. Then the answer is 3.

In the second example, you can obtain the string "ssddsdd" and get the answer 10.

In the fourth example, you can obtain the string "aaacaaa" and get the answer 15.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 210;
int n, k, ans, f[maxn][maxn][maxn];
string s, t;
int main() {
  cin >> n >> k >> s >> t;
  memset(f, -0x3f, sizeof(f));
  f[0][0][0] = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j <= k; ++j) {
      for (int l = 0; l <= i; ++l) {
        f[i + 1][j + 1][l + 1] =
            max(f[i + 1][j + 1][l + 1], f[i][j][l] + (t[0] == t[1]) * l);
        f[i + 1][j + 1][l + (t[0] == t[1])] =
            max(f[i + 1][j + 1][l + (t[0] == t[1])], f[i][j][l] + l);
        f[i + 1][j][l + (s[i] == t[0])] = max(f[i + 1][j][l + (s[i] == t[0])],
                                              f[i][j][l] + (s[i] == t[1]) * l);
      }
    }
  }
  for (int i = 0; i <= k; ++i) {
    for (int j = 0; j <= n; ++j) {
      ans = max(ans, f[n][i][j]);
    }
  }
  printf("%d", ans);
  return 0;
}