#include <bits/stdc++.h>
using namespace std;
int findMax(int*, int);
int findMin(int*, int);
int main() {
  int n, m, min, max, dmin, dmax, i, j;
  bool yes = true;
  cin >> n >> m >> min >> max;
  int data[m];
  for (i = 0; i < m; i++) scanf("%d", data + i);
  dmin = findMin(data, m);
  dmax = findMax(data, m);
  if (max < dmax || min > dmin)
    yes = false;
  else {
    if (!(max == dmax && min == dmin)) {
      if (((max == dmax || min == dmin) && n - m < 1) ||
          (max != dmax && min != dmin && n - m < 2))
        yes = false;
    }
  }
  if (yes)
    cout << "Correct\n";
  else
    cout << "Incorrect\n";
}
int findMin(int* a, int n) {
  int i, min = a[0];
  for (i = 0; i < n; i++)
    if (a[i] < min) min = a[i];
  return min;
}
int findMax(int* a, int n) {
  int i, max = a[0];
  for (i = 0; i < n; i++)
    if (a[i] > max) max = a[i];
  return max;
}
