#include "artclass.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <string>
#include <cassert>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define INF 1005141919
#define _1 first
#define _2 second
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
int sum = 0, sum_green = 0;
rep(y, H) rep(x, W) {
sum += R[y][x];
sum += G[y][x];
sum += B[y][x];
sum_green += G[y][x];
}
sum/=W*H;
sum/=3;
sum_green/=W*H;
return 1;
//cout<<"sum="<<sum<<", green="<<sum_green<<"\n";
//if (sum > 140) return 1;
//if (sum_green > sum+10) return 2;
//else return 3;
}
