Short lists with short programs in short time

We show how to construct for each string $x$ a list of size $O( |x|^2 )$ containing a $O(1)$-short program for $x$. The proof is based on the construction of graphs with online matching, introduced by Musatov, Romashchenko, and Shen.