#include<bits/stdc++.h>
using namespace std;

const int B = 317;
const int M = 1e5;
vector<int> verts;
bitset<M> bs;
bitset<M> heavy[B];
bool del[M];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> edg(m);
    vector<vector<int>> g(n);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        edg[i] = {u, v};
        g[u].push_back(i);
        g[v].push_back(i);
    }
    for (int i = 0; i < n; ++i) {
        if (g[i].size() >= B) {
            for (auto j : g[i]) {
                heavy[verts.size()][j] = 1;
            }
            verts.push_back(i);
        }
    }
    int q;
    cin >> q;
    while (q--) {
        char t;
        cin >> t;
        if (t == '+' || t == '-') {
            int v;
            cin >> v;
            --v;
            if (g[v].size() >= B) {
                bs ^= heavy[lower_bound(verts.begin(), verts.end(), v) - verts.begin()];
            } else {
                for (auto id : g[v]) {
                    if (!del[id]) bs[id] = !bs[id];
                }
            }
        } else if (t == '?') {
            int k = bs._Find_first();
            if (k >= m) {
                cout << "0\n";
            } else {
                bs[k] = 0;
                cout << k + 1 << '\n';
                del[k] = true;
                for (auto x : {edg[k].first, edg[k].second}) {
                    if (g[x].size() >= B) {
                        heavy[lower_bound(verts.begin(), verts.end(), x) - verts.begin()][k] = 0;
                    }
                }
            }
        }
    }
}