Help me in solving VOWMTRX problem...why this code is giving WA

help
,
1

My issue

My code

#include <bits/stdc++.h>
using namespace std;

const int mod = 1e9+7;

void solve(){
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    vector<int> mult;
    int cnt2 = 0;
    int cntc = 0;
    for(int i=0;i<n;i++){
        if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u'){
            cnt2++;
            if(cnt2==k){
                if(mult.size()){
                    mult.push_back(cntc);
                    cntc = 0;
                }else{
                    mult.push_back(101);
                }
                cnt2 = 0;
            }
        }else{
            if(mult.size()){
                cntc++;
            }
            
        }
    }
    int ans = 1;
    for(int j=1;j<mult.size();j++){
        ans = (ans*(mult[j]+1))%mod;
    }
    cout<<ans<<endl;
}
int main() {
	// your code goes here
	int t = 1;
	cin>>t;
	while(t--){
	    solve();
	}
	return 0;
}

Problem Link: VOWMTRX Problem - CodeChef