using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using Enu = System.Linq.Enumerable;

public class Program
{
    static readonly double g = 9.8;
    static readonly double Eps = 1e-9;
    int N, V, X, Y;
    int[][] Obstacles;

    public void Solve()
    {
        N = Reader.Int(); V = Reader.Int(); X = Reader.Int(); Y = Reader.Int();
        Obstacles = Reader.IntTable(N); // L, B, R, T
        bool yes = Can(X, Y) || Obstacles.Any(a => Can(a[0], a[3]) || Can(a[2], a[3]));
        Console.WriteLine(yes ? "Yes" : "No");
    }

    private bool Can(int x, int y)
    {
        double a = g * g / 4;
        double b = g * y - V * V;
        double c = x * x + y * y;
        double D = b * b - 4 * a * c;
        if (D <= 0) return false;
        for (int sign = -1; sign <= 1; sign += 2)
        {
            double t2 = (-b + sign * Math.Sqrt(D)) / (2 * a);
            if (t2 <= 0) continue;
            double t = Math.Sqrt(t2);
            double vx = x / t;
            double vy = (y + g * t * t / 2) / t;
            if (AllOK(vx, vy)) return true;
        }
        return false;
    }

    private bool AllOK(double vx, double vy)
    {
        Func<double, double> CalcY = time => time * (vy - g * time / 2);
        double t = X / vx;
        double ty = CalcY(t);
        if (ty < Y - Eps) return false;

        foreach (var a in Obstacles)
        {
            int L = a[0], Bottom = a[1], R = a[2], Top = a[3];
            R = Math.Min(R, X);
            if (L >= X) continue;
            if (R >= X && Top >= Y && Bottom <= ty) return false;
            int YL = Compare(CalcY(L / vx), Bottom, Top);
            int YR = Compare(CalcY(R / vx), Bottom, Top);
            if (YL * YR <= 0) return false;
            double topT = vy / g;
            int XH = Compare(vx * topT, L, R);
            int YH = Compare(CalcY(topT), Bottom, Top);
            if (XH == 0 && YL < 0 && YH >= 0) return false;
        }
        return true;
    }

    int Compare(double v, int lb, int ub)
    {
        if (v < lb + Eps) return -1;
        if (v > ub - Eps) return 1;
        return 0;
    }


    public struct Point : IEquatable<Point>, IComparable<Point>
    {
        public static readonly double Eps = 1e-9;
        public double X, Y;

        public Point(double x, double y) { X = x; Y = y; ; }

        public static Point operator +(Point a, Point b)
        {
            return new Point(Add(a.X, b.X), Add(a.Y, b.Y));
        }
        public static Point operator -(Point a, Point b)
        {
            return new Point(Add(a.X, -b.X), Add(a.Y, -b.Y));
        }
        public static Point operator *(double d, Point p)
        {
            return new Point(p.X * d, p.Y * d);
        }
        public static Point operator *(Point p, double d) { return d * p; }
        public double Norm { get { return Math.Sqrt(Add(X * X, Y * Y)); } }
        public double Distance(Point b) { return (b - this).Norm; }
        public double Dot(Point b) { return Add(X * b.X, Y * b.Y); }
        public double Det(Point b) { return Add(X * b.Y, -Y * b.X); }
        public bool Equals(Point b) { return X == b.X && Y == b.Y; }
        public override bool Equals(object obj) { return Equals((Point)obj); }
        public static bool operator ==(Point a, Point b) { return a.Equals(b); }
        public static bool operator !=(Point a, Point b) { return !a.Equals(b); }
        public int CompareTo(Point b) { return X != b.X ? Math.Sign(X - b.X) : Math.Sign(Y - b.Y); }
        public override int GetHashCode() { return (int)(X * 100000 + Y); }
        public override string ToString() { return X + " " + Y; }

        private static double Add(double a, double b)
        {
            if (Math.Abs(a + b) < Eps * (Math.Abs(a) + Math.Abs(b))) return 0;
            return a + b;
        }
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static T[] Range<T>(int N, Func<T> f) { return Enu.Range(0, N).Select(i => f()).ToArray(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}

Measured memory_bytes: 9492