A *triply line stochastic matrix* (t.l.s.m.) of size $N$ is a 3-dimensional array $(a_{ijk})_{i,j,k=1}^N$ with nonnegative entries, whose any row, column or line sums up to $1$. Their set is $TLS_N$.

Consider the following $0$-$1$ t.l.s.m. of size $2^n$ :

Keep the half-cube (of size $2^{n-1}$) containing $(1,1,1)$, and the 3 neighboring half-cubes "in diagonal", and put $0$ everywhere in the other 4 half-cubes. Repeat this operation in each of the 4 kept cubes of size $2^{n-1}$, keeping 4 cubes of size $2^{n-2}$ (the one nearest to $(1,1,1)$ and its 3 neighbors in diagonal), and putting $0$ everywhere else. An so on, until you are left with $2^{2n}$ points, one in each row, column or line, and put $a_{ijk}=1$ there.

By construction, this t.l.s.m. maximizes the total (sum of the entries) in *some* cubes containing $(1,1,1)$ i.e. $$\sum_{i,j,k=1}^{m}a_{i,j,k}\ge\sum_{i,j,k=1}^{m}b_{i,j,k}$$ for every t.l.s.m. $B:=(b_{ijk})_{i,j,k=1}^{2^n}\in TLS_{2^n}$ , whenever $m=2^p$, $0\le p\le n$ .

**Question** (motivated by Bound on the joint distribution of three real random variables with given two dimensional marginals) Does this inequality also hold for other values of $m$, $1\le m\le 2^n$ ?