1 #include<queue>
 2 #include<cstdio>
 3 #include<vector>
 4 #include<cstring>
 5 #include<iostream>
 6 #include<algorithm>
 7 #define RG register
 8 #define LL long long
 9 #define fre(a) freopen(a".in","r",stdin);//freopen(a".out","w",stdout);
10 using namespace std;
11 const int MAXN=1000;
12 int s,n,m,S,sum,All;
13 int c[MAXN],a[MAXN],dp[1<<16];
14 char ch;
15 int main()
16 {
17    while(scanf("%d%d%d",&s,&n,&m)!=EOF)
18       {
19          if(s==0)break;
20          All=(1<<(s*2))-1;
21          for(int i=1,flag,x;i<=n+m;i++)//鬼里鬼气的输入
22             {
23                a[i]=0;
24                scanf("%d",&c[i]);
25                flag=0;
26                while(1)
27                   {
28                      ch=getchar();
29                      while(ch<'0'||ch>'9')
30                         {
31                            if(ch=='\n'||ch=='\r') { flag=1; break; }
32                            ch=getchar();
33                         }
34                      if(flag)break;
35                      x=0;
36                      while('0'<=ch&&ch<='9')x=x*10+(ch-'0'),ch=getchar();
37                      a[i]|=(1<<(x-1));
38                      if(ch=='\n'||ch=='\r')break;
39                   }
40             }
41          S=sum=0;
42          for(int i=1;i<=n;i++)//按照规则，优先填后面的
43             {
44                sum+=c[i];
45                int p=S&a[i];
46                S|=(p<<s);
47                S|=a[i];
48             }
49          memset(dp,0x3f3f3f3f,sizeof dp);
50          dp[S]=sum;
51          for(int i=n+1;i<=n+m;i++)
52             {
53                for(int j=All;j>=S;j--)//按照规则，优先填后面的
54                   {
55                      int p=a[i]&j;
56                      p=a[i]|(p<<s);
57                      dp[j|p]=min(dp[j|p],dp[j]+c[i]);
58                   }
59             }
60          printf("%d\n",dp[All]);
61       }
62    return 0;
63 }