#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;int cnt[9];
char g[110][110];int main() {mem0(cnt);mem0(cnt);int n, m;cin >> n >> m;for( int i = 1; i <= n; i++ ) {for( int j = 1; j <= m; j++ ) {cin >> g[i][j];if(g[i][j] == 'R') cnt[0]++;else if(g[i][j] == 'G') cnt[1]++;else cnt[2]++;}}if( (n%3!=0) && (m%3!=0) ) {cout<< "NO" << endl;return 0;}int flag1 = 1;int flag2 = 1;if( cnt[0] == cnt[1] && cnt[1] == cnt[2] ) {if( n % 3 == 0 ) {char temp0 = g[1][1];for( int i = 1; i <= n / 3; i++ ) {for( int j = 1; j <= m; j++ ) {if( g[i][j] != temp0 ) {flag1 = 0;}}}char temp1 = g[n/3+1][1];for( int i = n/3+1; i <= 2*n/3; i++ ) {for( int j = 1; j <= m; j++ ) {if(g[i][j] != temp1) {flag1 = 0;}}}}else flag1 =0;if( m % 3 == 0 ) {
//            cout << "=" << endl;char temp0 = g[1][1];for( int i = 1; i <= n; i++ ) {for( int j = 1; j <= m/3; j++ ) {if(g[i][j] != temp0) {flag2 = 0;}}}char temp1 = g[1][m/3+1];for( int i = 1; i <= n; i++ ) {for( int j = m/3+1; j <= 2*m/3; j++ ) {if(g[i][j] != temp1) {flag2 = 0;}}}}else flag2 = 0;if(flag1 + flag2 > 0) {
//            cout << flag1 << " " << flag2 << endl;cout << "YES" << endl;return 0;}else {cout << "NO" << endl;return 0;}}else {cout << "NO" << endl;}return 0;
}

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;int dp[220][220][4];
int x[220];
int y[220];int main() {int n;int a, b;cin >> n >> a >> b;for( int i = 1; i <= 2*n; i+=2 ) {cin >> x[i] >> y[i];x[i+1] = y[i], y[i+1] = x[i];}int ans = 0;for( int i = 1; i <= 2*n; i++ ) {for( int j = 1; j <= 2*n; j++ ) {if( i != j && !((i&1)&&j==i+1) && !(!(i&1)&&j==i-1) ) {int temp1 = a-y[i];int temp2 = b-x[i];if( x[j] <= temp1 && y[j] <= b && temp2 >= 0 ) {ans = max( ans, x[i]*y[i]+x[j]*y[j] );}if( x[j] <= a && y[j] <= temp2 && temp1 >= 0 ) {ans = max( ans, x[i]*y[i]+x[j]*y[j] );}}}}cout << ans << endl;return 0;
}