In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

Ex Input:
2, 3, ['9773', 'e', 'G', 'm', '1859']

Ex Output:
0


Ex Input:
3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']

Ex Output:
35341


Ex Input:
15, 18, ['Q', '4243', 'U', '9909', '1695', 'J', '8967', '301', '3991', '1631', 'S', '8881', 'm', 'E', '667', '6581', 'H', 'b']

Ex Output:

7248