//看看会不会爆int!
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define ROF(i, r, l) for(int i = r; i >= l; i--)
#define all(a) a.begin(), a.end()
inline int ckmax(int &a, int b) { return a < b ? a = b, 1 : 0; }
inline int ckmin(int &a, int b) { return a > b ? a = b, 1 : 0; }
#define clean(a) memset(a, 0, sizeof(a))
typedef long long ll;

char s[100100];
int T;

int main(){
    scanf("%d", &T);
    while(T--){
        ll ans = 0;
        scanf("%s", s);
        int n = strlen(s), now = 0;
        for(int i = 0; i < n; ++i){
            if(s[i] == 'q') now++;
            else{
                ans += (ll)now * (now + 1) / 2;
                now = 0;
            }
        }
        ans += (ll)now * (now + 1) / 2;
        printf("%I64d\n", ans);
    }
  return 0;
}