Problem: You are given a string s of length n. Each character is either one of the first k lowercase Latin letters or a question mark.

You are asked to replace every question mark with one of the first k lowercase Latin letters in such a way that the following value is maximized.

Let f_i be the maximum length substring of string s, which consists entirely of the i-th Latin letter. A substring of a string is a contiguous subsequence of that string. If the i-th letter doesn't appear in a string, then f_i is equal to 0.

The value of a string s is the minimum value among f_i for all i from 1 to k.

What is the maximum value the string can have?

Input

The first line contains two integers n and k (1 ≤ n ≤ 2 ⋅ 10^5; 1 ≤ k ≤ 17) — the length of the string and the number of first Latin letters used.

The second line contains a string s, consisting of n characters. Each character is either one of the first k lowercase Latin letters or a question mark.

Output

Print a single integer — the maximum value of the string after every question mark is replaced with one of the first k lowercase Latin letters.

Examples

Input


10 2
a??ab????b


Output


4


Input


9 4
?????????


Output


2


Input


2 3
??


Output


0


Input


15 3
??b?babbc??b?aa


Output


3


Input


4 4
cabd


Output


1

Note

In the first example the question marks can be replaced in the following way: "aaaababbbb". f_1 = 4, f_2 = 4, thus the answer is 4. Replacing it like this is also possible: "aaaabbbbbb". That way f_1 = 4, f_2 = 6, however, the minimum of them is still 4.

In the second example one of the possible strings is "aabbccdda".

In the third example at least one letter won't appear in the string, thus, the minimum of values f_i is always 0.

Solution (in CPP):

Solution:

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

constexpr static int MOD = 1e9 + 7;
constexpr static int MAXN = 2e5 + 10;

void solve() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;

    // for each letter j, track (i, len)
    vector <vector <pair <int, int>>> a(k);
    for (int i = 0; i < n; i++) {
        int start = 0;
        int end = k;
        if (s[i] != '?') {
            start = s[i] - 'a';
            end = start + 1;
        }
        for (int j = start; j < end; j++) {
            if (a[j].size() != 0
                    && a[j].back().first + a[j].back().second == i) {
                a[j].back().second++;
            }
            else {
                a[j].push_back({i, 1});
            }
        }
    }
    /*
    for (int j = 0; j < k; j++) {
        for (auto& p : a[j])
            cerr << p.first << ":" << p.second << " ";
        cerr << endl;
    }
    */

    auto check = [&](int len) -> bool {
        // cerr << "checking " << len << endl;
        vector <vector <int>> pos(k, vector <int>(n, -1));
        for (int j = 0; j < k; j++) {
            for (auto& p : a[j]) {
                for (int i = 0; i + len <= p.second; i++) {
                    pos[j][p.first + i] = p.first + i + len;
                }
            }
            for (int i = n - 2; i >= 0; i--) {
                if (pos[j][i] != -1)
                    continue;
                pos[j][i] = pos[j][i + 1];
            }
            /*
            for (int i = 0; i < n; i++)
                cerr << pos[j][i] << ' ';
            cerr << endl;
            */
        }

        vector <int> dp(1 << k, -1);
        dp[0] = 0;
        for (int mask = 0; mask < (1 << k); mask++) {
            for (int j = 0; j < k; j++) {
                if (mask & (1 << j))
                    continue;
                if (dp[mask] == -1 || dp[mask] == n)
                    continue;
                int nxt_pos = pos[j][dp[mask]];
                if (nxt_pos == -1)
                    continue;
                int nxt_mask = mask ^ (1 << j);
                if (dp[nxt_mask] == -1 || dp[nxt_mask] > pos[j][dp[mask]])
                    dp[nxt_mask] = pos[j][dp[mask]];
            }
        }
        return dp[(1 << k) - 1] != -1;
    };

    // total O(log(n) * k * (n + 2^k))
    int l = 0, r = n / k;
    while (l < r) {
        int mid = (l + r + 1) / 2;
        if (check(mid))
            l = mid;
        else
            r = mid - 1;
    }
    cout << l << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    solve();
}