For instance, try it with l = 200, and r = 325 (basically, any time r is at least the value of
an even square, but less than an odd square).

firstQ :: Int -> Int -> Int
firstQ l pk = (-(1+l+pk) `div` 2) `mod` pk

nextQ :: Int -> Int -> Int -> Int
nextQ b pk qk = (qk - b) `mod` pk

sieveBlock :: [Int] -> [Int] -> [Int] -> [Int]
sieveBlock [] [] blk = blk
sieveBlock (p:ps) (o:ofs) blk = filter f (sieveBlock ps ofs blk)
  where
    f x = (x < o) || ((x - o) `mod` p /= 0)

getValsfromBlock :: Int -> [Int] -> [Int]
getValsfromBlock l bl = map (\x->l+1+2*x) bl

sieve :: Int -> Int -> Int -> [Int] -> [Int]
sieve l r b primes = middle $ until stop incr start
  where
    middle (_, v, _) = v
    stop (sb, _, _) = sb == r
    start = (l, [], map (firstQ l) primes)
    incr (startblock, primessofar, q) = (nextblock, nextprimes, nextq)
      where
	array = [0 .. b-1]
	nextblock = startblock + 2 * b
	nextprimes = primessofar ++ (getValsfromBlock startblock bl)
	nextq = zipWith (nextQ b) primes q
	bl = sieveBlock primes q array

main = print $ sieve 100 200 10 [3, 5, 7, 11, 13]