CF665B Shopping

Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online. The store contains $ k $ items. $ n $ customers have already used the above service. Each user paid for $ m $ items. Let $ a_{ij} $ denote the $ j $ -th item in the $ i $ -th person's order. Due to the space limitations all the items are arranged in one single row. When Ayush receives the $ i $ -th order he will find one by one all the items $ a_{ij} $ ( $ 1

The first line contains three integers $ n $ , $ m $ and $ k $ ( $ 1

Print the only integer $ t $ — the total time needed for Ayush to process all the orders.

Customer $ 1 $ wants the items $ 1 $ and $ 5 $ . $ pos(1)=3 $ , so the new positions are: $ [1,3,4,2,5] $ . $ pos(5)=5 $ , so the new positions are: $ [5,1,3,4,2] $ . Time taken for the first customer is $ 3+5=8 $ . Customer $ 2 $ wants the items $ 3 $ and $ 1 $ . $ pos(3)=3 $ , so the new positions are: $ [3,5,1,4,2] $ . $ pos(1)=3 $ , so the new positions are: $ [1,3,5,4,2] $ . Time taken for the second customer is $ 3+3=6 $ . Total time is $ 8+6=14 $ . Formally $ pos(x) $ is the index of $ x $ in the current row.