#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...)    69
#define debugArr(...)  69
#endif
using namespace std;

typedef long long     ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N = 23;
const int sq = 450;
const ll inf = 1e18;

#define F           first
#define S           second
#define pb          push_back
#define kill(x)     cout<<x<<endl, exit(0);
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define big(x)      (d[x] > sq)

int n,m;
bitset<N> bt;
vector<bitset<N>> GP;
vector<int> G[N];
int id[N];
int d[N];
bool is[N];

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m;
	for(int i = 1; i<= m ;i ++) {
		int v,u; cin>>v>>u;
		d[v] ++,d[u]++;
		G[v].pb(i); G[u].pb(i);
		is[i] =true;
	}
	int I = 0;
	for(int i = 1; i<= n ;i ++) {
		if(big(i)) {
			GP.pb(bitset<N>());
			id[i] = I;
			for(int u : G[i]) {
				GP[I][u] = 1;
			}
			I++;
			//debug(i,GP[I-1]);
		}
	}
	int q; cin>>q;
	while(q--) {
		char c; cin>>c;
		debug(bt);
		if(c != '?') {
			int v; cin>>v;
			if(big(v)) {
				bt = bt ^ GP[id[v]];
			} else {
				for(int u : G[v]) if(is[u]) bt[u] = 1 - bt[u];
			}
		} else {
			if(bt.none()) {
				cout<<0 << '\n';
			} else {
				int x =bt._Find_first();
				for(int i = 0; i < I; i ++) GP[i][x] = 0;
				bt[x] = 0;
				is[x] = 0;
				cout<<x << '\n';
			}
		}	
	}
	return 0;
}

// Jumpsuit, Jumpsuit cover me!
// Jumpsuit, Jumpsuit cover me!