CF794F Leha and security system

Bankopolis, the city you already know, finally got a new bank opened! Unfortunately, its security system is not yet working fine... Meanwhile hacker Leha arrived in Bankopolis and decided to test the system! Bank has $ n $ cells for clients' money. A sequence from $ n $ numbers $ a_{1},a_{2},...,a_{n} $ describes the amount of money each client has. Leha wants to make requests to the database of the bank, finding out the total amount of money on some subsegments of the sequence and changing values of the sequence on some subsegments. Using a bug in the system, Leha can requests two types of queries to the database: - 1 l r x y denoting that Leha changes each digit $ x $ to digit $ y $ in each element of sequence $ a_{i} $ , for which $ l

N/A

N/A

Let's look at the example testcase. Initially the sequence is $ [38,43,4,12,70] $ . After the first change each digit equal to $ 4 $ becomes $ 8 $ for each element with index in interval $ [1; 3] $ . Thus, the new sequence is $ [38,83,8,12,70] $ . The answer for the first sum's query is the sum in the interval $ [2; 4] $ , which equal $ 83+8+12=103 $ , so the answer to this query is $ 103 $ . The sequence becomes $ [38,83,8,12,78] $ after the second change and $ [38,73,7,12,77] $ after the third. The answer for the second sum's query is $ 38+73+7+12+77=207 $ .