1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int N=2e5+5, INF=1e9+5, mod=1e9+7;

vector<int> E[N];
int vis[N], czy[N];
vector<pair<int, pii> > ans;
void dfs(int v){
	vis[v]=1;
	for(int i:E[v]){
		if(!vis[i]){
			if(!czy[i])ans.pb({1, {1, i}});
			dfs(i);
		}
	}
}

void solve(int n){
	int m;
	cin>>m;
	czy[1]=1;
	for(int i=0; i<m; i++){
		int u, v;
		cin>>u>>v;
		E[u].pb(v);
		E[v].pb(u);
		if(u==1||v==1)czy[u+v-1]=1;
	}
	dfs(1);
	for(int i=1; i<=n; i++){
		for(int u:E[i]){
			if(u<i && u!=1){
				ans.pb({-1, {i, u}});
			}
		}
		E[i].clear();
		czy[i]=vis[i]=0;
	}
}

int main(){
	BOOST;
	int n;
	cin>>n;
	solve(n);
	auto res=ans;
	ans.clear();
	solve(n);
	for(auto &i:ans){
		i.st=-i.st;
	}
	reverse(all(ans));
	for(auto i:ans)res.pb(i);
		cout<<res.size()<<"\n";
	for(auto i:res){
		if(i.st==1)cout<<"+ "<<i.nd.st<<" "<<i.nd.nd<<"\n";
		else cout<<"- "<<" "<<i.nd.st<<" "<<i.nd.nd<<"\n";
	}
}