nt.number theory – Lower bound on a Truncated Divisor Sum

Let $d(n)$ be the number of divisors function, i.e., $d(n)=sum_{kmid n} 1$ of the positive integer $n$.

I am interested in estimating, the following sum
A(a,x)=sum_{nleq x} min( d(n), M)^a

from below for some function $M$ depending on $x,$ the upper limit.

For now, let $a=1.$

In the answer to the following question where the case $a=1$ was considered, the lower bound on $A(a,x)$ for the case $Mleq (log x)^{10},$ was stated to be of the same order as that of the upper bound in that answer.

Reading over the answer much later now, it is not so clear to me what the lower bound actually is, because the upper bound is also not fully stated. I have looked at the Selberg-Delange chapter, and the subsequent chapter in Tenenbaum’s Introduction to Probabilistic and Analytic Number Theory book as suggested, but it is still not fully clear what’s going on.

For example, Theorem 4, p. 205 in that book states
pi_k(x)=frac{x}{log x}frac{(log log x)^{k-1}}{k!}left{lambdaleft(
frac{k-1}{loglog x}right)+
Oleft(frac{k}{(log log x)^2}right)right}

where $$
pi_k(x)=mid { nleq x: omega(n)=k } mid,$$


and $k$ is allowed to grow with $n,$ with $1leq kleq A log log x.$

So presumably I need an estimate of the form
sum_{1leq k:2^kleq M} 2^k pi_k(x),

for the lower bound. What are the explicit steps in establishing this?