For integers $n\ge s\ge2$, let $e(n,s)$ denote the maximum size of a family $\F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e(n,s)$, now called the Erdős--Kleitman problem, is the non-uniform analogue of the Erdős matching problem. Fix $m\ge3$ and write $n=sm+c$, $\ell=s-c$. We prove that for every fixed $m\ge3$, there exists constants $β_m$ and $δ_m$ such that for sufficiently large $s$, the extremal families for $e(sm+c,s)$ are $P'(m,s,\ell;L')\coloneqq \binom{L'}m\cup\binom{[sm+c]}{\ge m+1}$ for some $L'$ with $|L'|=m\ell-1$ when $β_m s^{(m-1)/m}\le c\le δ_m s$. For $m=3$, we determine the asymptotic range of $\ell$ for which $P'(3,s,\ell;L')$ is extremal.