Let \( A = \{-2, -1, 0, 1, 2, 3, 4\} \) and \( R \) be a relation defined on set \( A \) such that \( R = \{(x, y) : 2x + y \leq -2, x, y \in A \} \).
Let \( l \) = number of elements in \( R \),
\( m \) = minimum number of elements to be added in \( R \) to make it reflexive relation,
\( n \) = minimum number of elements to be added in \( R \) to make it symmetric relation,
then \( (l + m + n) \) is: