直面warning的审判，反抗error的吊打，面对WA的指点，查看CE的原因，挑战TLE的挑衅，离开RE的追踪，大骂MLE的冲撞，回怼OLE的咒骂，鄙视SE的诅咒，修改UKE的源码，进入AC的光辉，甩掉PE的臭味，挑战Waiting的地位。

#include<bits/stdc++.h>
using namespace std;
int main()
{
	freopen("transport.in","r",stdin);
	freopen("transport.out","w",stdout);
	int s,e,x,y;
	cin>>s>>e>>x>>y;
	cout<<min(abs(s-e),min(abs(s-x)+abs(e-y),abs(s-y)+abs(e-x)));
	return 0;
	cout<<"byebye~";
}//最短的运输
#include<bits/stdc++.h>
using namespace std;
int read(){
    int a=0,k=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')
            k=-1;
        c=getchar();
    }
    while(isdigit(c)){
        a=a*10+c-'0';
        c=getchar();
    }
    return a*k;
}
struct game{
	int a,b;
}t[200005];
int main(){
	freopen("game.in","r",stdin);
 	freopen("game.out","w",stdout);
	int n=read();
	long long x;
	scanf("%lld",&x);
	long long minn=100000000000000000,ans=0;
	for(int i=1;i<=n;i++)
		t[i].a=read(),t[i].b=read();
	for(int i=1;i<=n&&x>0;i++){
		ans+=(t[i].a+t[i].b);
		x--;
		minn=min(minn,t[i].b*x+ans);
	}
	printf("%lld",minn);
    return 0;
}//游戏过关
#include <bits/stdc++.h>
using namespace std;
int t,n,k[100010],ans,x,now;
struct node {
	int a;
	int b;
} f[100010];
bool cmp(node x,node y) {
	if(x.a!=y.a)return x.a<y.a;
	return x.b>y.b;
}
int read(){
	int a=0,k=1;char c=getchar();
	while(!isdigit(c)){
		if(c=='-'){
			k=-1;
		}
		c=getchar();
	}
	while(isdigit(c)){
		a=a*10+c-'0';c=getchar();
	}
	return k*a;
}
int main() {
	freopen("play.in","r",stdin);
	freopen("play.out","w",stdout);
	scanf("%d",&t);
	while(t--) {
		scanf("%d",&n);
		for(int i=1; i<=n; i++) {
			f[i].a=-1e9;
			f[i].b=-1e9;
			scanf("%d",&k[i]);
			for(int j=1; j<=k[i]; j++) {
				x=read();
				if(f[i].b>x) {
					f[i].b++;
				} else {
					f[i].a=x-j+2;
					f[i].b=x+2;
				}
			}
		}
		sort(f+1,f+n+1,cmp);
		ans=f[1].a;
		now=f[1].b;
		for(int i=2; i<=n; i++) {
			if(now<f[i].a) {
				ans+=f[i].a-now;
				now=f[i].a;
			}
			now+=f[i].b-f[i].a;
		}
		cout<<ans<<endl;
	}
	return 0;
}//游戏通关