#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N, M, L;
int dp[1 << 16];

signed main() {
    while(cin >> N, N) {
        memset(dp, -1, sizeof(dp));
        dp[0] = 0;

        int ans = 0;
        rep(p,0,N) {
            int info = 0;
            cin >> M >> L;
            rep(i,0,M) {
                int S, E; cin >> S >> E;
                S -= 6, E -= 6;

                int val = 0;
                rep(j,S,E) val += (1 << j);
                info += val;
            }

            repr(bit,(1<<16)-1,0) {
                if(bit & info) continue;
                if(dp[bit] == -1) continue;
                chmax(dp[bit | info], dp[bit] + L);
            }
        }
        rep(i,0,1<<16) chmax(ans, dp[i]);
        cout << ans << endl;
    }
    return 0;
}