#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<vector>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 200010

#define M 500010

int n,m,ans[N],root[N],cnt=,flag[N];

vector<int> t[N],h[N],op[N],a[N];

struct data{int ch[],x,s;

}tree[M];

void build(int i,int &k,int l,int r)

{

    if (l>r) return;

    int mid=l+r>>;

    k=++cnt;tree[k].x=a[i][mid];

    if (l==r) {tree[k].s=;return;}

    build(i,tree[k].ch[],l,mid-);

    build(i,tree[k].ch[],mid+,r);

    tree[k].s=tree[tree[k].ch[]].s+tree[tree[k].ch[]].s+;

}

int query(int k,int x)

{

    if (k==) return ;

    if (x<tree[k].x) return query(tree[k].ch[],x);

    else return tree[tree[k].ch[]].s++query(tree[k].ch[],x);

}

int main()

{

#ifndef ONLINE_JUDGE

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

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

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    srand();

    n=read(),m=read();

    for (int i=;i<=m;i++)

    {

        char c=getchar();

        while (c!='!'&&c!='+'&&c!='-') c=getchar();

        if (c=='!') a[read()].push_back(i);

        else

        {

            int x=read(),y=read();

            t[x].push_back(i),h[x].push_back(y),op[x].push_back(c=='+'?-:);

            t[y].push_back(i),h[y].push_back(x),op[y].push_back(c=='+'?-:);

        }

    }

    for (int i=;i<=n;i++)

    if (a[i].size())

    {

        sort(a[i].begin(),a[i].end());

        build(i,root[i],,a[i].size()-);

    }

    for (int i=;i<=n;i++)

    {

        for (int j=;j<t[i].size();j++)

        ans[i]+=query(root[h[i][j]],t[i][j])*op[i][j],flag[h[i][j]]+=op[i][j];

        for (int j=;j<t[i].size();j++)

        if (flag[h[i][j]]) flag[h[i][j]]=,ans[i]+=tree[root[h[i][j]]].s;

    }

    for (int i=;i<=n;i++) printf("%d ",ans[i]);

    return ;

}