Complexity of finding a common coprime element

Question

Let $n_1,\ldots,n_u$ denote $u$ positive integers, all of which are bounded above by some integer $N$.

Question: 1. How hard is it to find an integer $m$ $(1 < m < N)$ that is coprime to $n_v$ for $1\leq v \leq u$?