By pigeonhole principle,
Let K denote the 1000 points in the three-dimensional space whose coordinates are all integers in the interval [1,10]. Let S be a subset of K that has at least 272 points. Prove that S contains two points u and v so that each coordinate of v is strictly larger than the corresponding coordinate of u.