Problem: User ainta decided to make a new instant messenger called "aintalk". With aintalk, each user can chat with other people. User ainta made the prototype of some functions to implement this thing.

  1. login(u): User u logins into aintalk and becomes online. 
  2. logout(u): User u logouts and becomes offline. 
  3. add_friend(u, v): User u and user v become friends. It means, u and v can talk with each other. The friendship is bidirectional. 
  4. del_friend(u, v): Unfriend user u and user v. It means, u and v cannot talk with each other from then. 
  5. count_online_friends(u): The function returns the number of friends of user u who are online at the moment. 



Because the messenger is being tested by some users numbered from 1 to n, there is no register method. This means, at the beginning, some users may be online, and some users may have friends.

User ainta is going to make these functions, but before making the messenger public, he wants to know whether he is correct. Help ainta verify his code.

Input

The first line contains three space-separated integers n, m and q (1 ≤ n ≤ 50000; 1 ≤ m ≤ 150000; 1 ≤ q ≤ 250000) — the number of users, the number of pairs of friends, and the number of queries.

The second line contains an integer o (1 ≤ o ≤ n) — the number of online users at the beginning. The third line contains o space-separated integers x1, x2, ..., xo (1 ≤ xi ≤ n) — the ids of the online users. It is guaranteed that these values are distinct.

Each of the next m lines contains two space-separated integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — the ids of two users who are friends at the beginning. It is guaranteed there are no multiple friendship given in the input. Note that the friendship is bidirectional.

Next q lines describe the q queries in the format:

  * "O u" (1 ≤ u ≤ n) : Call online(u). It is guaranteed that user u was offline just before the function call. 
  * "F u" (1 ≤ u ≤ n) : Call offline(u). It is guaranteed that user u was online just before the function call. 
  * "A u v" (1 ≤ u, v ≤ n; u ≠ v) : Call add_friend(u, v). It is guaranteed that these two users weren't friends just before the function call. 
  * "D u v" (1 ≤ u, v ≤ n; u ≠ v) : Call del_friend(u, v). It is guaranteed that these two users were friends just before the function call. 
  * "C u" (1 ≤ u ≤ n) : Call count_online_friends(u) and print the result in a single line. 

Output

For each count_online_friends(u) query, print the required answer in a single line. 

Examples

Input

5 2 9
1
4
1 3
3 4
C 3
A 2 5
O 1
D 1 3
A 1 2
A 4 2
C 2
F 4
C 2


Output

1
2
1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int BIG = 550;
const int maxn = 50010;
const int maxe = 150010;
const int maxq = 250010;
int big[maxn], res[maxn], state[maxn];
pair<int, int> edge[maxe];
vector<int> b;
vector<pair<int, int> > graph[maxn];
struct Query {
  int u, v;
  char c;
  void readIn() {
    while ((c = getchar()) && (c < 'A' || c > 'Z'))
      ;
    if (c == 'O' || c == 'F' || c == 'C')
      scanf("%d", &u), u--;
    else
      scanf("%d%d", &u, &v), u--, v--;
  }
} query[maxq];
void change(int u, int v) {
  lower_bound(graph[u].begin(), graph[u].end(), make_pair(v, 0))->second ^= 1;
  lower_bound(graph[v].begin(), graph[v].end(), make_pair(u, 0))->second ^= 1;
}
void update(int u, int x) {
  if (!big[u])
    for (__typeof(graph[u].begin()) e = graph[u].begin(); e != graph[u].end();
         e++)
      if (e->second) res[e->first] += x;
}
int main() {
  int n, m, q, online, u, v;
  scanf("%d%d%d%d", &n, &m, &q, &online);
  for (int i = 0; i < online; i++) {
    scanf("%d", &u);
    u--;
    state[u] = 1;
  }
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &u, &v);
    u--;
    v--;
    edge[i] = make_pair(u, v);
    graph[u].push_back(make_pair(v, 0));
    graph[v].push_back(make_pair(u, 0));
  }
  for (int i = 0; i < q; i++) {
    query[i].readIn();
    if (query[i].c == 'A') {
      graph[query[i].u].push_back(make_pair(query[i].v, 0));
      graph[query[i].v].push_back(make_pair(query[i].u, 0));
    }
  }
  for (int i = 0; i < n; i++) {
    sort(graph[i].begin(), graph[i].end());
    graph[i].resize(unique(graph[i].begin(), graph[i].end()) -
                    graph[i].begin());
  }
  for (int i = 0; i < n; i++) {
    big[i] = graph[i].size() >= BIG;
    if (big[i]) b.push_back(i);
  }
  for (int i = 0; i < m; i++) change(edge[i].first, edge[i].second);
  for (int i = 0; i < n; i++)
    if (state[i]) update(i, +1);
  for (int i = 0; i < q; i++) {
    char c = query[i].c;
    int u = query[i].u, v = query[i].v;
    if (c == 'O')
      state[u] = 1, update(u, +1);
    else if (c == 'F')
      state[u] = 0, update(u, -1);
    else if (c == 'A') {
      change(u, v);
      if (state[u] && !big[u]) res[v]++;
      if (state[v] && !big[v]) res[u]++;
    } else if (c == 'D') {
      change(u, v);
      if (state[u] && !big[u]) res[v]--;
      if (state[v] && !big[v]) res[u]--;
    } else if (c == 'C') {
      int result = res[u];
      for (__typeof(b.begin()) e = b.begin(); e != b.end(); e++) {
        vector<pair<int, int> >::iterator it =
            lower_bound(graph[u].begin(), graph[u].end(), make_pair(*e, 0));
        if (it != graph[u].end() && it->first == *e && it->second)
          result += state[*e];
      }
      printf("%d\n", result);
    }
  }
  return 0;
}