A mason has bricks with dimensions $2\times5\times8$ and other bricks with dimensions $2\times3\times7$. She also has a box with dimensions $10\times11\times14$. The bricks and the box are all rectangular parallelepipeds. The mason wants to pack bricks into the box filling its entire volume and with no bricks sticking out.
Find all possible values of the total number of bricks that she can pack.
1. **Define the problem and variables:**
   - Brick of type A: dimensions \(2 \times 5 \times 8\)
   - Brick of type B: dimensions \(2 \times 3 \times 7\)
   - Box: dimensions \(10 \times 11 \times 14\)

2. **Calculate volumes:**
   - Volume of the box: 
     \[
     10 \times 11 \times 14 = 1540 \text{ unit cubes}
     \]
   - Volume of brick A:
     \[
     2 \times 5 \times 8 = 80 \text{ unit cubes}
     \]
   - Volume of brick B:
     \[
     2 \times 3 \times 7 = 42 \text{ unit cubes}
     \]

3. **Set up the equation for the total volume:**
   \[
   80x + 42y = 1540
   \]
   where \(x\) is the number of type A bricks and \(y\) is the number of type B bricks.

4. **Simplify the equation:**
   \[
   80x + 42y = 1540 \implies 40x + 21y = 770
   \]

5. **Solve for \(y\) in terms of \(x\):**
   \[
   21y = 770 - 40x \implies y = \frac{770 - 40x}{21}
   \]
   For \(y\) to be an integer, \(770 - 40x\) must be divisible by 21.

6. **Find the general solution:**
   \[
   770 - 40x \equiv 0 \pmod{21}
   \]
   Simplify \(770 \pmod{21}\):
   \[
   770 \div 21 = 36 \text{ remainder } 14 \implies 770 \equiv 14 \pmod{21}
   \]
   Thus:
   \[
   14 - 40x \equiv 0 \pmod{21} \implies -40x \equiv -14 \pmod{21} \implies 40x \equiv 14 \pmod{21}
   \]
   Simplify \(40 \pmod{21}\):
   \[
   40 \equiv 19 \pmod{21} \implies 19x \equiv 14 \pmod{21}
   \]

7. **Solve the congruence \(19x \equiv 14 \pmod{21}\):**
   Find the multiplicative inverse of 19 modulo 21. Using the Extended Euclidean Algorithm:
   \[
   19 \cdot 10 \equiv 1 \pmod{21} \implies x \equiv 14 \cdot 10 \pmod{21} \implies x \equiv 140 \pmod{21} \implies x \equiv 14 \pmod{21}
   \]
   Thus:
   \[
   x = 14 + 21k \quad \text{for integer } k
   \]

8. **Substitute \(x\) back to find \(y\):**
   \[
   y = \frac{770 - 40(14 + 21k)}{21} = \frac{770 - 560 - 840k}{21} = \frac{210 - 840k}{21} = 10 - 40k
   \]

9. **Ensure non-negative solutions:**
   \[
   x \geq 0 \implies 14 + 21k \geq 0 \implies k \geq -\frac{14}{21} \implies k \geq -1
   \]
   \[
   y \geq 0 \implies 10 - 40k \geq 0 \implies k \leq \frac{10}{40} \implies k \leq \frac{1}{4}
   \]
   Since \(k\) must be an integer, the only possible value is \(k = 0\).

10. **Substitute \(k = 0\):**
    \[
    x = 14 + 21 \cdot 0 = 14
    \]
    \[
    y = 10 - 40 \cdot 0 = 10
    \]

11. **Verify the solution:**
    \[
    80 \cdot 14 + 42 \cdot 10 = 1120 + 420 = 1540
    \]
    The solution is valid.

12. **Check the configuration:**
    - The box can be filled with 14 bricks of type A and 10 bricks of type B as described in the solution.

The final answer is \(\boxed{24}\)