using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace ProgrammingContest { class Writer : IDisposable { private System.IO.TextWriter writer; private StringBuilder sb; private bool isReactive; public Writer(string path) : this(new System.IO.StreamWriter(path)) { } public Writer(bool isReactive) : this(null, isReactive) { } public Writer(System.IO.TextWriter writer = null, bool isReactive = false) { this.writer = (writer ?? Console.Out); this.isReactive = isReactive; if (!this.isReactive) { this.sb = new StringBuilder(); } } public void Dispose() { if (!this.isReactive) { this.writer.Write(sb.ToString()); } if (!this.writer.Equals(Console.Out)) { this.writer.Dispose(); } } public void Write(object val) { if (this.isReactive) { this.writer.Write(val.ToString()); this.writer.Flush(); } else { this.sb.Append(val.ToString()); } } public void Write(string format, params object[] vals) { if (this.isReactive) { this.writer.Write(format, vals); this.writer.Flush(); } else { this.sb.AppendFormat(format, vals); } } public void WriteLine(object val = null) { this.Write((val ?? string.Empty).ToString() + System.Environment.NewLine); } public void WriteLine(int val) { this.WriteLine(val.ToString()); } public void WriteLine(long val) { this.WriteLine(val.ToString()); } public void WriteLine(string val) { this.WriteLine((object)val); } public void WriteLine(string format, params object[] vals) { this.Write(format + System.Environment.NewLine, vals); } } class Scanner : IDisposable { private Queue buffer; private char[] sep; private System.IO.TextReader reader; public Scanner(string path, char[] sep = null) : this(new System.IO.StreamReader(path), sep) { } public Scanner(System.IO.TextReader reader = null, char[] sep = null) { this.buffer = new Queue(); this.sep = (sep ?? new char[] { ' ' }); this.reader = (reader ?? Console.In); } private void CheckBuffer() { if (this.buffer.Count == 0 && this.reader.Peek() != -1) { string str = string.Empty; for (; string.IsNullOrEmpty(str); str = this.reader.ReadLine()) ; str.Split(this.sep).ToList() .ForEach(el => this.buffer.Enqueue(el)); } } public void Dispose() { if (!this.reader.Equals(Console.In)) { this.reader.Dispose(); } } public string Next { get { this.CheckBuffer(); return this.buffer.Dequeue(); } } public string[] GetStringArray(int N) { return Enumerable.Range(0, N) .Select(e => this.Next) .ToArray(); } public int NextInt { get { return int.Parse(this.Next); } } public int[] GetIntArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextInt) .ToArray(); } public double NextDouble { get { return double.Parse(this.Next); } } public double[] GetdoubleArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextDouble) .ToArray(); } public long NextLong { get { return long.Parse(this.Next); } } public long[] GetLongArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextLong) .ToArray(); } public bool IsEnd { get { this.CheckBuffer(); return this.buffer.Count == 0; } } } class MainClass : IDisposable { Scanner sc; Writer wr; string backPath = ".."; char dirSep = System.IO.Path.DirectorySeparatorChar; string inFilePath = string.Empty; string outFilePath = string.Empty; public MainClass() { this.inFilePath = this.backPath + this.dirSep + this.backPath + this.dirSep + "in.txt"; this.outFilePath = this.backPath + this.dirSep + this.backPath + this.dirSep + "out.txt"; this.wr = new Writer(this.isReactive); //this.wr = new Writer(this.outFilePath); #if DEBUG if (!this.isReactive) { this.sc = new Scanner(this.inFilePath); } else { this.sc = new Scanner(); } #else this.sc = new Scanner(); #endif } static void Main(string[] args) { using (var mainClass = new MainClass()) { mainClass.Solve(); } } public void Dispose() { if (this.sc != null) { this.sc.Dispose(); this.sc = null; } if (this.wr != null) { this.wr.Dispose(); this.wr = null; } } void MakeTestCase() { Random rand = new Random(); if (this.wr != null) { this.wr.Dispose(); } this.wr = new Writer(inFilePath); } bool IsKadomonmatsu(long[] x) { return (x.Max() == x[1] || x.Min() == x[1]) && (x[0] != x[1] && x[1] != x[2] && x[2] != x[0]); } bool IsKadomonmatsu(double[] x) { return (x.Max() == x[1] || x.Min() == x[1]) && (x[0] != x[1] && x[1] != x[2] && x[2] != x[0]); } bool Calc(long[] x, long[] y, double time, bool isLowUp) { const int L = 3; var nx = x.Select(e => (double)e).ToArray(); for (int i = 0; i < L; i++) { nx[i] += y[i] * time; } if (IsKadomonmatsu(nx)) { throw new Exception(); } return (x[0] >= x[1] && x[1] >= x[2]) ^ isLowUp; } void Solve() { int N = sc.NextInt; for (int i = 0; i < N; i++) { var x = sc.GetLongArray(3); var y = sc.GetLongArray(3); if (IsKadomonmatsu(x)) { wr.WriteLine("YES"); continue; } bool isLowUp = x[0] <= x[1] && x[1] <= x[2]; double high = 1e9, low = 0; try { if (!Calc(x, y, high, isLowUp)) { wr.WriteLine("NO"); continue; } while (high - low > 10) { var mid = (low + high) / 2; if (Calc(x, y, mid, isLowUp)) { high = mid; } else { low = mid; } } while (low <= high) { Calc(x, y, low, isLowUp); low += 0.01; } } catch (Exception) { wr.WriteLine("YES"); continue; } wr.WriteLine("NO"); } } bool isReactive = false; // TODO: reactive check !! } }