#include "artclass.h"
#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(time(NULL));

const int SAME = 10;
const int C4 = 50, R4 = 20;
const int F = 115;

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    int cnt_green = 0;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            cnt_green += (G[i][j] - R[i][j] - B[i][j] >= 70);
        }
    }
    if (cnt_green >= H * W * 2 / 5) return 2;
    auto check = [&](int i, int j, int i1, int j1) {
        if (i1 < 0 || i1 >= H || j1 < 0 || j1 >= W) return false;
        if (abs(R[i][j]-R[i1][j1]) + abs(G[i][j]-G[i1][j1]) + abs(B[i][j]-B[i1][j1]) <= SAME) return true;
        return false;
    };
    auto check4 = [&](int i, int j, int i1, int j1) {
        if (i1 < 0 || i1 >= H || j1 < 0 || j1 >= W) return false;
        if (abs(R[i][j]-R[i1][j1]) + abs(G[i][j]-G[i1][j1]) + abs(B[i][j]-B[i1][j1]) <= C4) return true;
        return false;
    };
    auto check23 = [&](int i, int j, int i1, int j1) {
        if (i1 < 0 || i1 >= H || j1 < 0 || j1 >= W) return false;
        if (abs(R[i][j]-R[i1][j1]) + abs(G[i][j]-G[i1][j1]) + abs(B[i][j]-B[i1][j1]) > F) return true;
        return false;
    };
    int fuck = 1;
    for (int pnum = 0; pnum < R4; pnum++) {
        int i = rnd() % H, j = rnd() % W;
        queue<pair<int, int>> q;
        vector<vector<int>> used(H, vector<int>(W));
        q.push({i, j});
        int cnt = 0;
        while (!q.empty()) {
            auto [I, J] = q.front();
            used[I][J] = 1;
            q.pop();
            cnt++;
            if (I-1 >= 0 && !used[I-1][J]&&check4(I,J,I-1,J)){
                used[I-1][J]=1;
                q.push({I-1,J});
            }
            if (J-1>=0&&!used[I][J-1]&&check4(I,J,I,J-1)){
                used[I][J-1]=1;
                q.push({I,J-1});
            }
            if(I+1<H&&!used[I+1][J]&&check4(I,J,I+1,J)){
                used[I+1][J]=1;
                q.push({I+1,J});
            }
            if(J+1<W&&!used[I][J+1]&&check4(I,J,I,J+1)){
                used[I][J+1]=1;
                q.push({I,J+1});
            }
        }
        if (cnt < H * W / 5) fuck = 0;
    }
    if (fuck) return 4;

    int cnt = 0;
    vector<pair<int, int>> dir={{0,1},{1,0},{0,-1},{-1,0}};
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            for (auto d : dir) {
                cnt += check(i, j, i + d.first, j + d.second);
            }
        }
    }
    if (cnt >= H * W * 2) {
        return 1;
    }
    int cnt_bad =0;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            bool hassos = false;
            for (auto d : dir) {
                if (check23(i, j, i+d.first, j+d.second))hassos=true;
            }
            cnt_bad+=hassos;
        }
    }
    if (cnt_bad > H*W/3)return 3;
    return 2;
}