B"Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya has an array consisting of n numbers. He wants to perform m operations of two types: Petya has a list of all operations. The operations are such that after all additions the array won't have numbers that would exceed 104. Help Petya write a program that would perform these operations. The first line contains two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of numbers in the array and the number of operations correspondingly. The second line contains n positive integers, none of which exceeds 104 -- those are the array numbers. Next m lines contain operations, one per line. They correspond to the description given in the statement. It is guaranteed that after all operations are fulfilled each number in the array will not exceed 104. For each operation of the second type print the single number on the single line -- the number of lucky numbers in the corresponding interval. In the first sample after the first addition the array will look in the following manner: 4 5 6 After the second addition: 4 8 9 The second sample after the first addition: 7 7 7 7 After the second addition: 7 47 47 7"...