Our main theorem is about iterated forcing for making the continuum larger than ℵ2. We present a generalization of  which deal with oracles for random, (also for other cases and generalities), by replacing ℵ1,ℵ2 by λ, λ + (starting with λ = λ <λ > ℵ1). Well, we demand absolute c.c.c. So we get, e.g. the continuum is λ + but we can get cov(meagre) = λ and we give some applications. As in non-Cohen oracles , it is a “partial” countable support iteration but it is c.c.c.