The study of printability (namely, polynomial time (P) printability) was introduced by Hartmanis and Yesha [1]. Jenner and Kirsig [2] proved that every nondeterministic logspace (NL) printable set is a sparse set that is accepted by a 1-NL machine. This paper proves the converse, and a number of other interesting results regarding upward translation of equality, space-bounded Kolmogorov complexity, and space classes, via a hashing technique. The paper is clearly written, and even employs some sly humor.