Design a key-value store where each set(key, value, timestamp) records a value at a time, and get(key, timestamp) returns the value stored at the largest timestamp ≤ the queried one (or if none). Timestamps for a key are strictly increasing across set calls. TimeMap() constructs it. Input format Operation names + parallel argument lists.