Given a string s of length n and integer k (1 ≤ k ≤ n). The string s has a level x, if x is largest non-negative integer, such that it's possible to find in s:

  * x non-intersecting (non-overlapping) substrings of length k, 
  * all characters of these x substrings are the same (i.e. each substring contains only one distinct character and this character is the same for all the substrings). 



A substring is a sequence of consecutive (adjacent) characters, it is defined by two integers i and j (1 ≤ i ≤ j ≤ n), denoted as s[i ... j] = "s_{i}s_{i+1} ... s_{j}".

For example, if k = 2, then:

  * the string "aabb" has level 1 (you can select substring "aa"), 
  * the strings "zzzz" and "zzbzz" has level 2 (you can select two non-intersecting substrings "zz" in each of them), 
  * the strings "abed" and "aca" have level 0 (you can't find at least one substring of the length k=2 containing the only distinct character). 



Zuhair gave you the integer k and the string s of length n. You need to find x, the level of the string s.

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5) — the length of the string and the value of k.

The second line contains the string s of length n consisting only of lowercase Latin letters.

Output

Print a single integer x — the level of the string.

Examples

Input


8 2
aaacaabb


Output


2


Input


2 1
ab


Output


1


Input


4 2
abab


Output


0

Note

In the first example, we can select 2 non-intersecting substrings consisting of letter 'a': "(aa)ac(aa)bb", so the level is 2.

In the second example, we can select either substring "a" or "b" to get the answer 1.
import javafx.util.Pair;

import java.io.*;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
    class FastScanner {
        private BufferedReader bufferedReader;
        private StringTokenizer stringTokenizer;
        public FastScanner(InputStream inputStream){
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
        }
        public String next() {
            while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()){
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException ignored){}
            }
            return stringTokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }

    private FastScanner scanner;
    private PrintWriter printer;

    Main(InputStream scanner, PrintWriter printWriter) {
        this.scanner = new FastScanner(scanner);
        this.printer = printWriter;
    }

    int gcd (int a, int b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    boolean isPrime(int n) {
        for (int i = 2; i <= Math.sqrt(n); i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    List<Integer>prostMnoj(int n) {
        ArrayList<Integer> r = new ArrayList<>();
        int p = 2;
        while(n != 1) {
            while(n % p == 0) {
                n /= p;
                r.add(p);
            }
            p++;
            while(!isPrime(p)) {
                p++;
            }
        }
        return r;
    }

    List<Integer>allMnoj(List<Integer>a) {
        ArrayList<Integer>r = new ArrayList<>();
        boolean b[] = new boolean[a.size() + 1];
        while(!b[0]) {
            int i = a.size();
            while(b[i]) {
                i--;
            }
            b[i++] = true;
            while(i<b.length) {
                b[i++] = false;

            }
            int m = 1;
            for (i = 1; i < b.length; i++) {
                if (b[i]) {
                    m*=a.get(i-1);
                }
            }
            r.add(m);
        }
        return r;
    }

    double a(long n) {
        return (180.0 * (n-2)) / n;
    }

    void next (int a[]) {
        for (int i = a.length - 2; i >= 0; i--) {
            if (a[i] < a[i+1]) {
                for (int j = a.length - 1;; j--) {
                    if (a[j] > a[i]) {
                        int t = a[i];
                        a[i] = a[j];
                        a[j] = t;
                        break;
                    }
                }
                for (int j = i + 1; j <= i + ((a.length - 1) - i) / 2; j++) {
                    int t = a[j];
                    int k = (a.length - 1) - (j - (i + 1));
                    a[j] = a[k];
                    a[k] = t;
                }
                break;
            }
        }
    }

    int fact(int n) {
        if (n == 1) return 1;
        return n * fact(n - 1);
    }

    int dfs(List<List<Integer>>g, int v, boolean used[]) {
        if (used[v]) return 0;
        used[v] = true;
        int sum = 1;
        for (int i = 0; i < g.get(v).size(); i++) {
            sum += dfs(g, g.get(v).get(i), used);
        }
        return sum;
    }

    int find(List<List<Integer>>g, int v, int x, boolean used[]) {
        if (used[v]) return -1;
        used[v] = true;
        if (g.get(v).contains(x)) return v;
        for (int i = 0; i < g.get(v).size(); i++) {
            int res = find(g, g.get(v).get(i), x, used);
            if (res != -1) return res;
        }
        return -1;
    }

    int dp[] = new int[101];
    {
        Arrays.fill(dp, -1);
    }

    int[] ms(int n) {
        int dp[] = new int[n + 1];
        int tp[] = new int[n + 1];
        dp[1] = 0;
        tp[1] = 1;
        for (int i = 2; i <= n; i++) {
            int t = i - 1;
            dp[i] = dp[i - 1];
            if (i % 2 == 0 && dp[i / 2] < dp[i]) {
                dp[i] = dp[i / 2];
                t = i / 2;
            }
            if (i % 3 == 0 && dp[i / 3] < dp[i]) {
                dp[i] = dp[i / 3];
                t = i / 3;
            }
            dp[i]++;
            tp[i] = t;
        }
        printer.println(dp[n]);
        int t = n;
        StringBuilder s = new StringBuilder();
        while (t != 1) {
            s.insert(0, t);
            s.insert(0, " ");
            t = tp[t];
        }
        s.insert(0, "1");
        printer.println(s);
        return dp;
    }

    double gg(List<List<Integer>>g, boolean used[], int v) {
        List<Integer> gv = g.get(v);
        used[v] = true;
        if (gv.isEmpty()) return 0;
        if (gv.size() == 1 && used[gv.get(0)]) {
            return 0;
        }
        int k = 0;
        double sum = 0;
        for (int i = 0; i < gv.size(); i++) {
            if (!used[gv.get(i)]) {
                sum += gg(g, used, gv.get(i));
                k++;
            }
        }
        return sum / k + 1;
    }

    long fib(long n)
    {
        if (n < 1) return 0;
        long a = 0;
        long b = 1;
        for (int i = 2; i <= n; i++) {
            long t = a + b;
            a = b;
            b = t;
        }
        return b;
    }

    List<List<Integer>>g = new ArrayList<>();
    int d[];
    int a[];

    int dist(int x, int y) {
        return 0;
    }

    int ggg(int v) {
        if (d[v] == -1) {
            d[v] = 1;
            int x = a[v];
            for (int i = 0; i < g.get(v).size(); i++) {
                d[v] = Math.max(d[v], gcd(x, ggg(g.get(v).get(i))));
            }
        }
        return d[v];
    }

    void run() {
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        String s = scanner.next();
        char c = 'a';
        int ans = 0;
        for (int i = 0; i < 26; i++) {
            char cc = (char) (c + i);
            //printer.println(cc);
            //printer.println("==========");
            Matcher matcher = Pattern.compile(cc+"+").matcher(s);
            int cnt = 0;
            while (matcher.find()) {
                cnt += matcher.group().length() / k;
            }
            ans = Math.max(ans, cnt);
        }
        printer.println(ans);
        printer.flush();
        printer.close();
    }

    public static void main(String [] args) {
        long start = System.currentTimeMillis();
        new Main(System.in, new PrintWriter(System.out)).run();
        long finish = System.currentTimeMillis();
        System.err.println(finish - start + "ms");
    }
}