#include <bits/stdc++.h>

#define rint register int

#define IL inline

#define rep(i,h,t) for (rint i=h;i<=t;i++)

#define dep(i,t,h) for (rint i=t;i>=h;i--)

#define ll long long

using namespace std;

const int N=2e5;

char s[N];

int len,cnt,son[N][],pos[N],cnt2;

struct hz{

  int ch[N][],node,len[N],fa[N];

  hz()

  {

    node=;

  }

  int extend(int c,int z)

  {

  int lst=z;

  int f=lst;

  if (ch[f][c]&&len[ch[f][c]]==len[f]+)

  {

    lst=ch[f][c];

    return(lst);

  }

  int p=++node; lst=p;

  len[p]=len[f]+; //size[p][pl]=1;

  while (f&&!ch[f][c]) ch[f][c]=p,f=fa[f];

  if (!f) { fa[p]=; return(p);};

  int x=ch[f][c],y=++node;

  if (len[f]+==len[x]) {fa[p]=x; node--;return(p);}

  len[y]=len[f]+; fa[y]=fa[x]; fa[x]=fa[p]=y;

  memcpy(ch[y],ch[x],sizeof(ch[x]));

  while (f&&ch[f][c]==x) ch[f][c]=y,f=fa[f];

  return(p);

  }

  void build(int x)

  {

    rep(i,,)

      if (son[x][i])

      {

        pos[son[x][i]]=extend(i,pos[x]);

        build(son[x][i]);

      }

  }

}S;

int l,head[N],bz[N][],dfn[N],rl[N],dis[N],fa[N],dep[N],zt[N];

struct re{

  int a,b;

}a[N];

void arr(int x,int y)

{

  a[++l].a=head[x];

  a[l].b=y;

  head[x]=l;

}

void dfs(int x,int y)

{

  int u=head[x]; bz[x][]=y; dfn[x]=++cnt2; rl[cnt2]=x;

  dep[x]=dep[y]+;

  dis[x]=dis[y]+S.len[x]-S.len[y];

  while (u)

  {

    int v=a[u].b;

    dfs(v,x);

    u=a[u].a;

  }

}

set<int> M;

set<int>::iterator it;

int lca(int x,int y)

{

  if (dep[x]<dep[y]) swap(x,y);

  dep(i,,)

    if (dep[bz[x][i]]>=dep[y]) x=bz[x][i];

  if (x==y) return(x);

  dep(i,,)

    if (bz[x][i]!=bz[y][i]) x=bz[x][i],y=bz[y][i];

  return(bz[x][]);

}

int main()

{

  freopen("1.in","r",stdin);

  freopen("3.out","w",stdout);

  scanf("%s",s);

  len=strlen(s);

  int now=;

  cnt=;

  rep(i,,len-)

  {

    if (s[i]=='-') now=fa[now];

    else

    {

      if (!son[now][s[i]-'a']) son[now][s[i]-'a']=++cnt,fa[cnt]=now;

      now=son[now][s[i]-'a'];

    }

  }

  pos[]=; S.build();

  for(int i=;i<=S.node;i++) arr(S.fa[i],i);

  dfs(,);

    rep(i,,)

    rep(j,,S.node) bz[j][i]=bz[bz[j][i-]][i-];

  ll ans=; now=;

 int cnt3=;

  rep(i,,len-)

  {

    if (s[i]=='-')

    {

      int x=,y=;

      ans-=dis[now];

      it=M.find(dfn[now]); it++;

      if (it!=M.end()) x=rl[*it]; it--;

      if (it!=M.begin()) y=rl[*--it];

      M.erase(dfn[now]);

      if (x) ans+=dis[lca(now,x)];

      if (y) ans+=dis[lca(now,y)];

      if (x&&y) ans-=dis[lca(x,y)];

      now=zt[--cnt3];

    } else

    {

      int x=,y=;

      now=S.ch[now][s[i]-'a'];

      zt[++cnt3]=now;

      ans+=dis[now];

      it=M.insert(dfn[now]).first;

      it++;

      if (it!=M.end()) x=rl[*it]; it--;

      if (it!=M.begin())

      {

        y=rl[*--it];

      }

      if (x) ans-=dis[lca(now,x)];

      if (y) ans-=dis[lca(now,y)];

      if (x&&y) ans+=dis[lca(x,y)];

   //   cout<<lca(pos[now],x)<<" "<<lca(pos[now],y)<<" "<<x<<" "<<y<<endl;

    }

    printf("%lld\n",ans);

  }

  return ;

}