Dlsj is competing in a contest with n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these problems.

However, he can submit ii-th problem if and only if he has submitted (and passed, of course) s_isi​ problems, the p_{i, 1}pi,1​-th, p_{i, 2}pi,2​-th, ......, p_{i, s_i}pi,si​​-th problem before.(0 < p_{i, j} \le n,0 < j \le s_i,0 < i \le n)(0<pi,j​≤n,0<j≤si​,0<i≤n) After the submit of a problem, he has to wait for one minute, or cooling down time to submit another problem. As soon as the cooling down phase ended, he will submit his solution (and get "Accepted" of course) for the next problem he selected to solve or he will say that the contest is too easy and leave the arena.

"I wonder if I can leave the contest arena when the problems are too easy for me."
"No problem."
—— CCF NOI Problem set

If he submits and passes the ii-th problem on tt-th minute(or the tt-th problem he solve is problem ii), he can get t \times a_i + b_it×ai​+bi​ points. (|a_i|, |b_i| \le 10^9)(∣ai​∣,∣bi​∣≤109).

Your task is to calculate the maximum number of points he can get in the contest.

Input

The first line of input contains an integer, nn, which is the number of problems.

Then follows nn lines, the ii-th line contains s_i + 3si​+3 integers, a_i,b_i,s_i,p_1,p_2,...,p_{s_i}ai​,bi​,si​,p1​,p2​,...,psi​​as described in the description above.

Output

Output one line with one integer, the maximum number of points he can get in the contest.

Hint

In the first sample.

On the first minute, Dlsj submitted the first problem, and get 1 \times 5 + 6 = 111×5+6=11 points.

On the second minute, Dlsj submitted the second problem, and get 2 \times 4 + 5 = 132×4+5=13 points.

On the third minute, Dlsj submitted the third problem, and get 3 \times 3 + 4 = 133×3+4=13 points.

On the forth minute, Dlsj submitted the forth problem, and get 4 \times 2 + 3 = 114×2+3=11 points.

On the fifth minute, Dlsj submitted the fifth problem, and get 5 \times 1 + 2 = 75×1+2=7 points.

So he can get 11+13+13+11+7=5511+13+13+11+7=55 points in total.

In the second sample, you should note that he doesn't have to solve all the problems.

#include <bits/stdc++.h>

#define MAX 21

typedef long long ll;

using namespace std;

const int INF = 0x3f3f3f3f;

ll a[MAX],b[MAX];

ll dp[<<];

vector<int> v[MAX];

int main(void)

{

    int n,num,temp,i,j,k;

    scanf("%d",&n);

    for(i=;i<=n;i++) {

        scanf("%lld %lld",&a[i],&b[i]);

        scanf("%d",&num);

        while(num--) {

            scanf("%d",&temp);

            v[i].push_back(temp);

        }

    }

    memset(dp,,sizeof(dp));

    for(i=;i<(<<n);i++){

        int f=;

        for(j=;j<=n;j++){

            if(!((<<(j-))&i)) continue;

            for(k=;k<v[j].size();k++){

                if(!((<<(v[j][k]-))&i)){

                    f=;

                    break;

                }

            }

            if(f==) break;

        }

        if(f==) continue;

        for(j=;j<=n;j++){

            if(!((<<(j-))&i)) continue;

            int S=i;

            int c=;

            while(S){

                if(S&) c++;

                S>>=;

            }

            dp[i]=max(dp[i],dp[i^(<<(j-))]+c*a[j]+b[j]);

            //printf("(%d %d %d %lld)",i,c,j,dp[i]);

        }

    }

    printf("%lld\n",dp[(<<n)-]);

    return ;

}