Since you already know how to solve for the two goods case with $u(x)=\min(x_1,x_2)$ you can solve the optimization problem in a two-stage method without using Lagrangian.
UMP: $$\begin{aligned}
\max_{x_1,x_2,x_3\geq 0} \quad & \min(x_1,x_2)+x_3\\
\textrm{s.t.} \quad & p_1x_1+p_2x_2+p_3x_3\leq M\end{aligned}$$
Stage one: Solving the problem with respect to $x_1$ and $x_2$ holding $x_3$ constant
$$\max_{x_3}\begin{pmatrix}{\begin{aligned}\max_{x_1,x_2} \quad & \min(x_1,x_2)+x_3\\
\textrm{s.t. } \quad & p_1x_1+p_2x_2\leq M-p_3x_3\end{aligned}}\end{pmatrix}$$
The problem inside the parentheses yields: $x_1(p,x_3,M)=x_2(p,x_3,M)=\frac{M-p_3x_3}{p_1+p_2}$
Notice that the solution to the problem inside the brackets is similar to a demand function for $u=\min(x_1,x_2)$ with the difference being that we adjusted income in the demand function for the expenditure that might occur on $x_3$
Stage Two: Solving the entire problem in terms of $x_3$ after obtaining demands for $x_1,x_2$ as a function of $x_3$.
Substituting the values of $x_1,x_2$ that we derived above in the problem inside the parentheses gives us the following optimization problem in $x_3$:
$$\begin{aligned}
\max_{0\leq x_3\leq \frac{M}{p_3}} \quad & x_3+\frac{M-p_3x_3}{p_1+p_2} \\
\max_{0\leq x_3\leq \frac{M}{p_3}} \quad & \frac{(p_1+p_2-p_3)x_3}{p_1+p_2}+\frac{M}{p_1+p_2}
\end{aligned}$$
from the above problem, we get the demand function for $x_3$ and consequently the demand functions for $x_1, x_2$ by substituting the demand for $x_3$ in our solution to the Stage One problem.
$\boxed{(x_1,x_2,x_3)^d(p,M)=\begin{cases}(\frac{M}{p_3},0,0) & \text{if } p_1+p_2>p_3\\
(\frac{M}{p_1+p_2},\frac{M}{p_1+p_2},0) & \text{if } p_1+p_2\leq p_3\end{cases}}$
Intuitively it is like a solution to a perfect substitute utility function, but one of the goods is a composite good consisting of two goods which are complementary.