Let $S$ be an NP-complete problem and $Q$ and $R$ be two other problems not known to be in NP. $Q$ is polynomial-time reducible to $S$ and $S$ is polynomial-time reducible to $R$. Which of the following statements is true?