#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

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


const long long int mod = 1000000007;
const long long int INF = 1e18;

long long int level[100]={1};
long long int pate[100]={1};
long long int X,M,N,sum=0,res=0,a[1005],b[1005],c[1005][15];
long long int dp[1005][10000];
pll key[1005];
string str[1234];
int main()
{
    cout << fixed << setprecision(18);
    cin>>N>>M;
    for(long long int i = 0; i < M; i++){
        cin>>a[i]>>b[i];
        long long int tmp=0;
        for(long long int j = 0; j <b[i] ; j++){
            cin>>c[i][j];
            tmp+=(1<<(c[i][j]-1));
        }
        key[i+1]={tmp,a[i]};
    }
    for(long long int i = 0; i < (1<<N); i++){
        for(long long int j = 0; j <= M; j++){
            dp[j][i]=INF;
        }
    }
    dp[0][0]=0;
    for(long long int i = 1; i <= M; i++){
        for(long long int j = 0; j < (1<<N); j++){
            dp[i][key[i].first | j]=min(dp[i][key[i].first | j],dp[i-1][j]+key[i].second);
            dp[i][j]=min(dp[i][j],dp[i-1][j]);
        }
    }
    if(dp[M][(1<<N)-1]==INF){dp[M][(1<<N)-1]=-1;}
    cout<<dp[M][(1<<N)-1]<<endl;
}


Measured memory_bytes: 77312