#include <bits/stdc++.h>
using namespace std;
int mas[100005];
int main() {
  int n, m, min, max;
  cin >> n >> m >> min >> max;
  int cnt = 0;
  for (int i = 1; i < m + 1; ++i) cin >> mas[i];
  sort(mas, mas + m + 1);
  if (mas[1] > min) ++cnt;
  if (mas[m] < max) ++cnt;
  if ((mas[1] < min) || (mas[m] > max) || (cnt > n - m)) {
    cout << "Incorrect";
    return 0;
  }
  cout << "Correct";
  return 0;
}
