The unification problem in a propositional logic is to determine, given a formula ϕ, whether there exists a substitution σ such that σ(ϕ) is in that logic. In that case, σ is a unifier of ϕ. When a unifiable formula has minimal complete sets of unifiers, it is either infinitary, finitary, or unitary, depending on the cardinality of its minimal complete sets of unifiers. Otherwise, it is nullary. In this paper, we prove that in modal logic K + ⊥, unifiable formulas are either finitary, or unitary.