Implement an integer map with insert, get, addToKey (add x to every key) and addToValue (add y to every value); apply up to 100,000 queries and return the sum of all get results.

Implement a map from integers to integers with four operations. insert(x, y) stores value y under key x. get(x) returns the value stored under key x. addToKey(x) increases every key currently in the map by x. addToValue(y) increases every value currently in the map by y. The operations come as two parallel lists: the operation names, and for each one its arguments (two numbers for insert, one number for the other three). Apply them in order and return one number, the total of the values returned by the get calls. There can be up to 100,000 operations, all keys and values stay between -10^9 and 10^9 throughout, and the total needs a 64-bit integer. Example: insert(3, 10), insert(5, 20), addToKey(2), addToValue(-4), get(7), get(5) returns 16 + 6 = 22.