Bit Problem - Problem Statement

Given $n$ integers, compute three counts for each element $x$:

$1.$ How many elements $y$ satisfy $x \mid y = x$? (OR equals $x$)

$2.$ How many elements $y$ satisfy $x \land y = x$? (AND equals $x$)

$3.$ How many elements $y$ satisfy $x \land y \neq 0$? (AND is non-zero) Constraints: $n \leq 2 \times 10^5$, values up to $10^6$. The brute force $O(n^2)$ is too slow. Each query type needs a different SOS DP formulation.