We are given:
We aim to compute the total number of distinct intersection points.
If all 37 lines intersect pairwise without concurrency:
\[ \text{Total Intersections} = \binom{37}{2} = \frac{37 \cdot 36}{2} = 666 \]
\[ \binom{13}{2} = \frac{13 \cdot 12}{2} = 78 \] But since all 13 lines intersect at point A, they produce only 1 intersection.
So, we subtract:
\[ 78 - 1 = 77 \]
\[ \binom{11}{2} = \frac{11 \cdot 10}{2} = 55 \] But all 11 lines intersect at point B, producing only 1 intersection.
So, we subtract:
\[ 55 - 1 = 54 \]
\[ \text{Valid Intersections} = 666 - 77 - 54 = \boxed{535} \]
\[ \boxed{535 \text{ distinct points of intersection}} \]
The number of 6-letter words, with or without meaning, that can be formed using the letters of the word MATHS such that any letter that appears in the word must appear at least twice, is $ 4 \_\_\_\_\_$.
If all the words with or without meaning made using all the letters of the word "KANPUR" are arranged as in a dictionary, then the word at 440th position in this arrangement is: