//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int m,n;
char s[maxn];
/*==============================head==========================*/
int main(){
    int T;
    cin >> T;
    while(T -- > 0){
        scanf("%s", s);
        int len = strlen(s);
        int tmp = 0;
        ll ans = 0;
        for(int i = 0; i < len; i++){
            if(s[i] == 'q') tmp ++;
            else{
                ans += 1LL*tmp*(tmp+1)/2;
                tmp = 0;
            }
        }
        ans += 1LL*tmp*(tmp+1)/2;
        cout<<ans<<endl;
    }
    return 0;
}