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
115
116
117
118
119
120
121
122
123
124
#include <vector>
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/time.h>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <set>
#include <map>
#include <iomanip>
#include <queue>

#define FOR(i,a,b)  for(__typeof(b) i=(a);i<(b);++i)
#define REP(i,a)    FOR(i,0,a)
#define FOREACH(x,c)   for(__typeof(c.begin()) x=c.begin();x != c.end(); x++)
#define ALL(c)      c.begin(),c.end()
#define CLEAR(c)    memset(c,0,sizeof(c))
#define SIZE(c) (int) ((c).size())

#define PB          push_back
#define MP          make_pair
#define X           first
#define Y           second

#define ULL         unsigned long long
#define LL          long long
#define LD          long double
#define II         pair<int, int>
#define DD         pair<double, double>
#define FF          pair<float,float>

#define VC	    vector
#define VI          VC<int>
#define VVI         VC<VI>
#define VVVI        VC<VVI>
#define VD          VC<double>
#define VS          VC<string>
#define VII         VC<II>
#define VDD         VC<DD>
#define VFF         VC<FF>
#define VVD         VC<VD>
#define VVVD        VC<VVD>
#define VULL         VC<ULL>

#define DB(a)       cerr << #a << ": " << a << endl;

using namespace std;

template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";}
template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); }
VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;}

struct Graph{
    int N;
    VC<set<int> > edges;
};

void read_graph(Graph &G){
    G.edges.resize(G.N);
    int M;
    cin >> M;
    int x,y;
    REP(i,M){
        cin >> x >> y;
        x--;y--;
        G.edges[x].insert(y);
        G.edges[y].insert(x);
    }
}

VII make_star_0(Graph &G){
    VI visited(G.N,0);
    visited[0] = 1;
    VI stack;
    stack.PB(0);
    VII P;
    while (SIZE(stack) > 0){
        int x = stack.back();
        stack.pop_back();
        for(auto y : G.edges[x])
            if (!visited[y]){
                visited[y] = 1;
                stack.PB(y);
                if (G.edges[0].find(y) == G.edges[0].end())
                    P.PB(MP(1,y+1));
            }
    }
    FOR(x,1,G.N)
        for(auto y : G.edges[x])
            if (x < y)
                P.PB(MP(-x-1,-y-1));
    return P;
}

void dump_prog(VII &P){
    cout << SIZE(P) << endl;
    for(auto e : P){
        if (e.X > 0)
            cout << "+ " << e.X << " " << e.Y << endl;
        else
            cout << "- " << -e.X << " " << -e.Y << endl;
    }
}

int main(int argc, char *argv[]){
    int N;
    cin >> N;
    Graph G[2];
    VII P[2];
    REP(i,2){
        G[i].N = N;
        read_graph(G[i]);
        P[i] = make_star_0(G[i]);
    }
    reverse(ALL(P[1]));
    for(auto e : P[1]) P[0].PB(MP(-e.X,-e.Y));

    dump_prog(P[0]);

    return 0;
}