include

include

using namespace std; /* int main(){

int a[3];
cin >> a[0] >>a[1] >>a[2];
int all = a[0] + a[1] + a[2];
int ans  = 0,tag = 1e9;

for(int i=0;i<3;i++){
	int diff = all - a[i]*2;
	if(abs(diff) < tag){
		tag = diff;
		ans = max(diff + a[i],a[i]);
	}
}
cout << ans << " " << all - ans;
return 0;

} / / int n,m; int main(){

scanf("%d%d",&n,&m);
int sum = 0;
int all = 0;
int t,p;
for(int i=0;i<n;i++){
	scanf("%d%d",&t,&p);
	if(t == 1) sum += p;
	all += p;
}
float ans = 1.0 * m * sum / all;
printf("%.3f",ans);
return 0;

}

0<curx&&curx <= n&&cury>0&&cury<=m / / const int N = 1010; int a[N][N]; int n,m; int x1,y1,x2,y2;

int main(){

scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
	for(int j = 1;j<=m;j++)
		scanf("%d",&a[i][j]);
int t;
scanf("%d",&t);
while(t--){
	scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
	swap(a[x1][y1],a[x2][y2]);
} 
int cnt = 0;
int x[] = {1,0,-1,0},y[] = {0,-1,0,1};
for(int i=1;i<=n;i++)
	for(int j = 1;j<=m;j++){
		bool flag = true;
		for(int k=0;k<4;k++){
			int curx = i + x[k];
			int cury = j + y[k];
			if(a[i][j] <= a[curx][cury]){
				flag = false;
				break;
			}
		}
		if(flag) cnt++;
	}

cout << cnt;
return 0;

} */

/* int main(){

int n,t;
cin >> n >>t;
int x,ans = 0,prev = -1;

while(n--){
	cin >> x;
	if(prev == -1 || prev + t < x) {
		ans += t;
		prev = x;
	}
	else {
		ans += x - prev;
		prev = x;
	}
}
cout << ans;
return 0;

} / / const int N = 1000010; int a[N];

int main(){

int n,d;
cin >> n >> d;
for(int i=0;i<n;i++) scanf("%d",&a[i]);
int ans =0 ;
for(int i=0;i<n;i++){
	int f = a[i] + d;
	for(int j = i+ 1;j<n;j++ ){
		if(a[j] > f) break;
		ans++;
	}
}
cout << ans; 
return 0;

} / / const int N = 1010; int a[N][N]; int main(){

int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)
		scanf("%d",&a[i][j]);
int type, x1,x2;
while(m--){
	scanf("%d%d%d",&type,&x1,&x2);
	if(type){
		for(int i=1;i<=n;i++) swap(a[x1][i],a[x2][i]);
	}else{
		for(int i=1;i<=n;i++) swap(a[i][x1],a[i][x2]);
	}
}
for(int i=1;i<=n;i++){
	for(int j=1;j<=n;j++)
		printf("%d ",a[i][j]);
	printf("\n");
}
return 0;

} */

/* const int N = 1010; int a[N][N]; int n,m,c;

int main(){

scanf("%d%d%d",&n,&m,&c);
int t;
for(int i=1;i<=n;i++){
	for(int j = 1;j<=m;j++){
		scanf("%d",&t);
		a[i][j] = t + a[i-1][j] + a[i][j-1] - a[i-1][j-1];
	}
}
int ans = -1e9;
int x,y;
for(int i = c;i<=n;i++){
	for(int j = c;j<=m;j++){
		int v = a[i][j] - a[i-c][j] - a[i][j-c] + a[i-c][j-c];
		if(v > ans){
			ans = v;
			x = i;
			y = j;
		}
	}
}
cout << x - c + 1 << " " << y - c + 1 ;
return 0;

} */