 Our data structure uses space in n\cdot O\left({\epsilon^{-1}}\right)^{k} + O(nm) and  query time in O\left(k\right).
<meaning-changed>  Our data structure uses space in n\cdot O\left({\epsilon^{-1}}\right)^{k} + O(nm) and  query time in O\left(k\right).
 Our first data structure achieves a (5+\epsilon) approximation factor, uses space in n\cdot O\left({\epsilon^{-1}}\right)^{k} + O(nm) and query time in O\left(k\right).