We introduce contextads and the \(\mathbb {C}\mathsf {tx}\) construction, unifying various structures and constructions in category theory dealing with context and contextful arrows -- comonads and their Kleisli construction, actegories and their \(\mathcal {P}\mathsf {ara}\) construction, adequate triples and their \(\mathbb {S}\mathsf {pan}\) construction. Contextads are defined in terms of Lack-Street wreaths, suitably categorified for pseudomonads in a tricategory of spans. This abstract approach can be daunting, so in this talk we will work with a lower-dimensional version of contextads which is relevant to capture dependently graded comonads arising in functional monadic programming. In fact we show that many side-effects monads can be dually captured by discrete contextads, seen as dependently graded comonads, and gesture towards a general result on the 'transposability' of parametric right adjoint monads to dependently graded comonads.