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 strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to: