Chef and odd queries

Chef has N segments. For each i (1 ≤ i ≤ N), the i-th segment starts at point Li and ends at point Ri (let's denote it by [Li,  Ri]). Let's say that a segment [l, r] crosses a point x if l ≤ x ≤ r. Chef wants you to answer Q queries. In each query, you are given a set of M distinct points X1, X2, ..., XM; you should compute the number of good segments [Li, Ri] among the given N segments. A segme