We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1, \ldots, F_\ell \in \mathcal{F}$ and $F_1', \ldots, F_\ell' \in \mathcal{F}'$, then $\lvert \mathcal{F} \rvert \cdot \lvert \mathcal{F}' \rvert \leq \binom{n-t}{k-t} \binom{n-t}{k'-t}$, provided that $n$ is sufficiently large. This extends a celebrated theorem of Pyber for large $n$, which determines the tight upper bound for the product of the sizes of cross $1$-intersecting families.