Let be a square, and let be distinct points inside the square. Non-intersecting segments are drawn for various pairs with , such that the square is dissected into triangles. Assume each is an endpoint of at least one of the drawn segments. How many triangles are formed?