Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Lucky Array

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPetya 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:

- add
*l**r**d*— add an integer*d*to all elements whose indexes belong to the interval from*l*to*r*, inclusive (1 ≤*l*≤*r*≤*n*, 1 ≤*d*≤ 10^{4}); - count
*l**r*— find and print on the screen how many lucky numbers there are among elements with indexes that belong to the interval from*l*to*r*inclusive (1 ≤*l*≤*r*≤*n*). Each lucky number should be counted as many times as it appears in the interval.

Petya has a list of all operations. The operations are such that after all additions the array won't have numbers that would exceed 10^{4}. Help Petya write a program that would perform these operations.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}) — the number of numbers in the array and the number of operations correspondingly. The second line contains *n* positive integers, none of which exceeds 10^{4} — 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 10^{4}.

Output

For each operation of the second type print the single number on the single line — the number of lucky numbers in the corresponding interval.

Examples

Input

3 6

2 3 4

count 1 3

count 1 2

add 1 3 2

count 1 3

add 2 3 3

count 1 3

Output

1

0

1

1

Input

4 5

4 4 4 4

count 1 4

add 1 4 3

count 1 4

add 2 3 40

count 1 4

Output

4

4

4

Note

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

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/18/2020 05:23:22 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|