**Problem 6:**

Forty MOVers (Mathematical Olympiad Volunteers) are sitting in a circle. Munir Hasan randomly chooses $3$ volunteers to help in the awards ceremony. In how many ways can the volunteers be chosen such that at least $2$ of the volunteers were sitting next to each before being chosen?