How to optimize the generation of combinations?

Question

I have the following code:

const montar = (volante, todos, posicao, restantes) => {
  if (restantes === 0) {
    return [volante];
  }

  const tamanho = todos.length - (restantes - 1);
  let novos = [];

  for (let indice = posicao; indice < tamanho; indice++) {
    const possivel = todos[indice];
    const volantes = montar([...volante, possivel], todos, indice + 1, restantes - 1);
    novos = [...novos, ...volantes];
  }

  return novos;
};

console.time('Calculando');
console.log(montar([], [1, 2, 3, 4, 5], 0, 3).length);
console.timeEnd('Calculando');

It generates all possible lottery wheels given the numbers that can be chosen and the amount per steering wheel. However, I believe I decide recursion, the amount of memory allocated to calculate the possibilities of games with many possible numbers makes execution unfeasible.

Would like to optimize memory usage of this code to be able to generate, for example, all the wheels of the mega-sena (which are 6 numbers chosen from 1 to 60, generating 50.063.860 arrays) without impairing the performance.