If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial numbers, then the serial number of the word THAMS is :

Let $$\mathrm{A}=\{1,3,4,6,9\}$$ and $$\mathrm{B}=\{2,4,5,8,10\}$$. Let $$\mathrm{R}$$ be a relation defined on $$\mathrm{A} \times \mathrm{B}$$ such that $$\mathrm{R}=\left\{\left(\left(a_{1}, b_{1}\right),\left(a_{2}, b_{2}\right)\right): a_{1} \leq b_{2}\right.$$ and $$\left.b_{1} \leq a_{2}\right\}$$. Then the number of elements in the set R is :

If the $$1011^{\text {th }}$$ term from the end in the binominal expansion of $$\left(\frac{4 x}{5}-\frac{5}{2 x}\right)^{2022}$$ is 1024 times $$1011^{\text {th }}$$R term from the beginning, then $$|x|$$ is equal to

$$\left|\begin{array}{ccc}x+1 & x & x \\ x & x+\lambda & x \\ x & x & x+\lambda^{2}\end{array}\right|=\frac{9}{8}(103 x+81)$$, then $$\lambda, \frac{\lambda}{3}$$ are the roots of the equation :