#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int maxn = 1e6;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int base = 31;
const int UP = 1e8;
string s;
void init() {}
void Time_Decreasing() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void enter() { cin >> s; }
void solve() {
  int res = 0;
  int cnt = 0;
  int tmp = 0;
  long long ans = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '-')
      res--;
    else
      res++;
    if (cnt + res < 0) {
      ans = ans + i + 1;
      cnt++;
    }
  }
  int len = s.size();
  ans = ans + len;
  cout << ans << '\n';
}
int main() {
  init();
  Time_Decreasing();
  int tc;
  cin >> tc;
  while (tc--) {
    enter();
    solve();
  }
}
