$A$ parallelogram is cut by two sets of $m$ parallel lines,each set being parallel to one of its sides. How many parallelograms are formed in total?

Let $l_1$ and $l_2$ be two lines intersecting at $P$. If $A_1, B_1, C_1$ are points on $l_1$,and $A_2, B_2, C_2, D_2, E_2$ are points on $l_2$,and if none of these points coincides with $P$,then the number of triangles formed by these eight points is:

$p$ points are chosen on each of the three coplanar lines. The maximum number of triangles formed with vertices at these points is

If $t_n$ denotes the number of triangles formed with $n$ points in a plane,no three of which are collinear,and if $t_{n+1}-t_n=36$,then $n$ is equal to

Let $P_{1}, P_{2}, \ldots, P_{15}$ be $15$ points on a circle. The number of distinct triangles formed by points $P_{i}, P_{j}, P_{k}$ such that $i+j+k \neq 15$ is:

The number of shortest paths from $HOSTEL$ to $ALLEN$ is equal to (as shown in the given figure):