The question "how are the first order conditions" seems very unclear to me, and I am providing a set-up for finding and writing them out, while explaining the Kuhn-Tucker conditions that are easy to struggle with.
Though we try to avoid giving away basic study question answers, it's a positively voted question without an answer, and I still think these questions have value for future users. Enough time has also passed where there's no risk of helping someone get through a class, if that was the intention.
Usually in cost minimization problems where the production function is a constraint, there is a set quantity to be produced that then leads to minimizing cost with respect to that. Here in this profit maximization problem, you have a minimum amount of production required of both goods, which I find interesting.
We can note the objective function (profit) is linear, and therefore concave and differentiable. The constraints are more interesting because the Cobb-Douglas form is not necessarily concave, namely when the exponents sum to more than 1. So you can ask yourself when the constraints will be convex (they are certainly differentiable). These ideas are related to the sufficient conditions for an optimum. A solution exists by the Weierstrass Theorem (constraint is compact and the objective function is continuous).
To look at the first order necessary conditions, we can omit your last two equalities since they don't add anything. We take:
\begin{equation}
\begin{array}{l}
\max_{q_{x}, q_{y}, l_{x}, l_{y}, k_{x}, l_{x}} \quad p_{x}q_{x}+p_{y}q_{y}-w(l_{x}+l_{y})-v(k_{x}+k_{y}) \\
\text{s.t.} \\
q_{x} - k_{x}^{\alpha}l_{x}^{\beta} \leq 0 \\
q_{y} - k_{y}^{\gamma}l_{y}^{\delta} \leq 0 \\
\end{array}
\end{equation}
Form the Lagrangean:
$$\max \quad \mathscr{L} = p_{x}q_{x}+p_{y}q_{y}-w(l_{x}+l_{y})-v(k_{x}+k_{y}) - \mu_x (q_{x} - k_{x}^{\alpha}l_{x}^{\beta}) - \mu_y (q_{y} - k_{y}^{\gamma}l_{y}^{\delta})$$
(note the signs in front of the Lagrangean multipliers)
Then, in place of the derivative with respect to the multipliers, we have our constraints with complementary slackness conditions. We take the other constraints as well.
$$\frac{\partial \mathscr{L}}{\partial \ ( \cdot )} \leq 0 \quad ; \quad ( \cdot ) \geq 0 \quad \forall ( \cdot )$$
$$\text{constraint} \quad ; \quad \mu_{(\cdot)} \geq 0$$
And from there you can move on to solve the system, but you may find yourself in a weird spot because we haven't been able to establish uniqueness.