#include <bits/stdc++.h>

using namespace std;

int n, m1, m2;

int u, v, d;

int ans;

int p[];

int a[][], b[][];

int main() {

    while(~scanf("%d%d%d", &n, &m1, &m2)) {

        d = ans = ;

        memset(a, , sizeof(a));

        memset(b, , sizeof(b));

        for(int i = ; i <= m1; i++) {

            scanf("%d%d", &u, &v);

            a[u][v] = a[v][u] = ;

        }

        for(int i = ; i <= m2; i++) {

            scanf("%d%d", &u, &v);

            b[u][v] = b[v][u] = ;

        }

        for(int i = ; i <= ; i++) p[i] = i;

        // 图E1的自同构

        do {

            int f = ;

            for(int i = ; f && i <= n; i++)

                for(int j = ; f && j <= n; j++)

                    if(a[i][j] && (!a[p[i]][p[j]])) f = ;

            if(f) d++;

        } while(next_permutation(p+, p+n+));

        // 图E2和E1的同构

        do {

            int f = ;

            for(int i = ; f && i <= n; i++)

                for(int j = ; f && j <= n; j++)

                    if(a[i][j] && (!b[p[i]][p[j]])) f = ;

            if(f) ans++;

        } while(next_permutation(p+, p+n+));

        printf("%d\n", ans/d);

    }

}