The paper [Harry Buhrman, Michal Koucky, Nikolay Vereshchagin. Randomized Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331] considered communication complexity of the following problem. Alice has a binary string x and Bob a binary string y, both of length n, and they want to compute or approximate Kolmogorov complexity C(xy) of x conditional to y. It is easy to show that deterministic communication complexity of approximating C(xy) with precision is at least n−2−O(1). The above referenced paper asks what is randomized communication complexity of this problem and shows that for r-round randomized protocols its communication complexity is at least ((n)1r)