Number of ways to choose 2 distinct positions for R’s from those \( < m \)? No: we need R’s chosen from positions 1 to \( m-1 \), but no: since max R must be < m, so R’s ∈ 1,2,...,m−1, and we choose 2 of them: number is \(\binomm-12\) if \( m-1 \geq 2 \), else 0. - Nelissen Grade advocaten