What you would do is you would implement the meet-in-the-middle attack against this point, you would build a table of size 2^56 of all possible encryptions of m, and then you would try to decrypt with all 2^112 keys until you find a collision, and when you find a collision, you have basically found k1, k2, k3. 