#include "artclass.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=507;
ll C[LIM][LIM][3], F[LIM*LIM], ile[LIM*LIM], dx[]={1, 0, -1, 0}, dy[]={0, 1, 0, -1}, n, m;
bool podobne(int x1, int y1, int x2, int y2) {
int sum=0;
rep(i, 3) sum+=abs(C[x1][y1][i]-C[x2][y2][i]);
return sum<=5;
}
bool ok(int a, int b) {
return 0<=a && a<n && 0<=b && b<m;
}
int fnd(int x) {
if(F[x]==x) return x;
return F[x]=fnd(F[x]);
}
void uni(int x, int y) {
if(fnd(x)==fnd(y)) return;
ile[fnd(x)]+=ile[fnd(y)];
F[fnd(y)]=fnd(x);
}
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
n=H; m=W;
rep(i, n) rep(j, m) {
C[i][j][0]=R[i][j];
C[i][j][1]=G[i][j];
C[i][j][2]=B[i][j];
ile[i*m+j]=1;
F[i*m+j]=i*m+j;
}
ll sum=0;
rep(i, n-9) rep(j, m-9) {
ll mi[3], ma[3];
rep(a, 3) mi[a]=ma[a]=C[i][j][a];
rep(a, 10) rep(b, 10) rep(c, 3) {
mi[c]=min(mi[c], C[i+a][j+b][c]);
ma[c]=max(ma[c], C[i+a][j+b][c]);
}
int li=0;
rep(a, 3) li+=ma[a]-mi[a];
if(li<20) ++sum;
}
if(sum>200) {
sum=0;
rep(i, n) rep(j, m) if(C[i][j][0]+C[i][j][1]+C[i][j][2]<100) ++sum;
//rep(i, n) rep(j, m) if(C[i][j][0]>=200 && C[i][j][1]>=200 && C[i][j][2]>=200) ++sum;
//return sum;
if(sum>1000) return 1;
return 4;
}
sum=0;
rep(i, n) rep(j, m) if(C[i][j][1]>2*max(C[i][j][0], C[i][j][2])) ++sum;
if(sum>300) return 2;
return 3;
}
