Question 3Binh has ten segments of lengths $1,2,\ldots,10$. How many ways can he choose three segments that form a nondegenerate triangle? 4546495055