Make 2009 non-overlapping points in a piece of triangular paper (all points are not on any side of the triangle), and use these 2009 points and the 3 vertices of the triangular paper as vertices to cut out a triangle at most how many?
在一张三角形纸内任作2009个互不重合的点(所有的点都不在三角形的任意一条边上)，以这2009个点和三角形纸的3个顶点为顶点的三角形，最多能剪出多少个？
<gadget id="calculator">360 * 2_009</gadget>
<output>723_240</output>

<gadget id="calculator">723_240 + 180</gadget>
<output>723_420</output>

<gadget id="calculator">723_420 / 180</gadget>
<output>4_019</output>

<result>4_019</result>