#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
char a[101000];
long long n,t,i,l,tot,ans,T;
int main(){
    scanf("%I64d",&T);
    while (T--){
        scanf(" %s",&a);
        l=strlen(a);
        tot=0;
        ans=0;
        for (i=0;i<l;i++){
            if (a[i]=='q') tot++;
            else{
                ans+=(tot+1)*tot/2;
                tot=0;
            }
        }
        ans+=(tot+1)*tot/2;
        printf("%I64d\n",ans);
    }
}