#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fact(long long j) {
  long long a = 1;
  for (long long i = 1; i <= j; i++) a *= i;
  return a;
}
long long pw(long long a, long long b) {
  long long s = 1;
  for (int i = 0; i < (b); i++) s *= a;
  return s;
}
long long sum2(long long c) {
  long long s = 0;
  while (c != 0) {
    s += (c % 10) * (c % 10);
    c /= 10;
  }
  return s;
}
vector<int> merge(const vector<int>& a, const vector<int>& b) {
  long long p1 = 0, p2 = 0;
  vector<int> c;
  for (; p1 < a.size() && p2 < b.size();)
    if (a[p1] == b[p2]) {
      c.push_back(a[p1]);
      p1++;
      p2++;
    } else if (a[p1] < b[p2])
      p1++;
    else
      p2++;
  return c;
}
bool cmp(long long a, long long b) { return (a < b); }
bool prime(long long a) {
  if (a == 0 || a == 1) return false;
  for (int i = 2; i <= sqrt(a); i++)
    if (a % i == 0) return false;
  return true;
}
long long C(long long n, long long k) {
  vector<vector<long long> > dp(n + 1, vector<long long>(n + 1, 1));
  for (int i = 0; i < (n + 1); i++) {
    for (int j = 1; j < i; j++) {
      dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
    }
  }
  return dp[n][k];
}
vector<bool> pr(10000000 + 1, true);
long long er(long long n) {
  pr[0] = false;
  pr[1] = false;
  for (int i = 2; i * i <= n; i++) {
    if (pr[i]) {
      for (int j = i * i; j <= n; j += i) {
        if (pr[j]) pr[j] = false;
      }
    }
  }
  return 0;
}
long long dp[100005][2];
int main() {
  long long n, m;
  cin >> n >> m;
  char x;
  while (cin >> x) {
    if (x == 'C' || x == 'M' || x == 'Y') {
      cout << "#Color" << endl;
      return 0;
    }
  }
  cout << "#Black&White" << endl;
  return 0;
}
