The Enemy of My Enemy Is My Friend!

Winnie-the-Pooh signed up for a new social network called VLesu. Each user has a friend list and also an enemy list. Anyone can be added to an enemy list, but two conditions apply:

1. If user $v$ is an enemy of user $u$, then $u$ is not necessarily an enemy of $v$.
2. A user cannot be an enemy of themselves.

Winnie-the-Pooh spent whole days recording who became whose enemy, because he wanted to know everything happening in their forest. He believed nobody visits their enemy. He also believed an enemy's enemy is a friend, and anyone who respects their friends should visit them. He wants to know how many friends user $v$ has.

In Winnie-the-Pooh's view, user $u$ is a friend of user $v$ if:

1. $u$ is an enemy of some enemy of $v$.
2. $u$ is not an enemy of $v$.

No user is their own friend.

The first line contains the number of users $n$ and the number of queries $m$ ($1 \le n$, $m \le 2000$).

Each of the next $m$ lines is one of two query types:

• + v u: user $v$ starts considering user $u$ an enemy.
• ? v: find the number of friends of user $v$ in Winnie-the-Pooh's sense.

The input is guaranteed to be correct. A user never makes themselves an enemy, and no user becomes the enemy of another user more than once.

For each query ? v, print the answer on a separate line.