Programmer 
Content
FRESH GRAD NO000000!!!!! YOU CAN’T JUST USE BRUTEFORCE HERE!!! WE NEED TO USE SEGMENT TREES TO GET THE UPDATE TIME COMPLEXITY DOWN TO LOG(N)!!!! BREAK THE DATA INTO SQRT CHUNKS AT LEAST… OHH GOD THE INFEFFICIENY NOOO NOOOOO!!!! haha nested for loop go brrrrri SENIOR DEV for user in users for address in user address for city in address cities