import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; const L = readLong; const R = readLong; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } A.sort; bool check(int i, int j) { const prod = A[i] * A[j]; return (L <= prod && prod <= R); } int ans = 1; if (R < 0) { foreach (i; 0 .. N) foreach (j; i + 1 .. N) if (A[i] * A[j] < 0) { if (check(i, j)) { chmax(ans, 2); } } } else { foreach (i; 0 .. N) foreach (j; i + 1 .. N) { if (check(i, i + 1) && check(i, j) && check(j - 1, j)) { chmax(ans, j - i + 1); } } } writeln(ans); } } catch (EOFException e) { } }