#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <ctime>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define calm (l+r)>>1
const int INF=2139062143;

const int maxn=100010;
char s[maxn];
inline ll sum(ll x){
    return x*(x+1)/2;
}
int main(){
    //freopen("D://input.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        scanf("%s",s);
        int cnt=0;
        ll ans=0;
        for(int i=0;s[i];i++){
            if(s[i]=='q'){
                cnt++;
            }
            else{
                ans+=sum(cnt);
                cnt=0;
            }
        }
        ans+=sum(cnt);
        printf("%I64d\n",ans);
    }
    return 0;
}