#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int z[maxn];
int main() {
  int n, m, min, max, t, pd, i, x, y, num;
  while (~scanf("%d%d%d%d", &n, &m, &min, &max)) {
    t = n - m;
    pd = 0;
    x = y = 0;
    num = m;
    for (i = 1; i <= m; i++) {
      scanf("%d", &z[i]);
      if (z[i] == min) x = 1;
      if (z[i] == max) y = 1;
    }
    if (x == 0 && y == 0)
      z[++num] = min, z[++num] = max;
    else if (x == 0)
      z[++num] = min;
    else if (y == 0)
      z[++num] = max;
    sort(z + 1, z + 1 + num);
    if (num > n)
      printf("Incorrect\n");
    else {
      if (z[num] > max || z[1] < min)
        printf("Incorrect\n");
      else
        printf("Correct\n");
    }
  }
  return 0;
}
