NUMERICAL
Let $S=\{4,6,9\}$ and $T=\{9,10,11, \ldots, 1000\}$. If $A=\left\{a_{1}+a_{2}+\ldots+a_{k}: k \in \mathbf{N}, a_{1}, a_{2}, a_{3}, \ldots, a_{k}\right.$ $\epsilon S\}$, then the sum of all the elements in the set $T-A$ is equal to __________.
NUMERICAL
The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.
NUMERICAL
Let $S=\left\{p_1, p_2 \ldots, p_{10}\right\}$ be the set of first ten prime numbers. Let $A=S \cup P$, where $P$ is the set of all possible products of distinct elements of $S$. Then the number of all ordered pairs $(x, y), x \in S$, $y \in A$, such that $x$ divides $y$, is ________ .