Given a rectangle $ABCD$ on a cell sheet. Here $AB = 3$; $AD = 4$. Two point $M$ and $N$ are chosen inside the rectangle. The distance from $M$ to $AB$ is equal to $1$, the distance from $M$ to $AD$ is equal to $2$. The distance from $N$ to $CD$ equals $2$; from $N$ to $AD$ equals $1$. Points $Q$, $R$, $S$, $T$ were chosen on the sides $AB$, $BC$, $CD$, $AD$. At what positions of the points $P$, $Q$, $S$, $T$ is the sum $MQ + MR + MS + MT + NQ + NR + NS + NT$ minimal?
From the conditions we know that we cannon change the positions of points $ M $ and $ N $. Also I think I know a theorem that might help here.
Theorem. Given two points $ A $ and $ B $ and a line $ l $, find a point $ C $ on the line $ l $ if we know that $ AC + BC $ is minimum. (In the case when the points lie on different sides of the line, we must only draw a line, and if not, we have to draw a point $ D $ which is symmetrical to $ B $, and then connect $ A $ and $ D $.)

