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.

Input: Consider Input: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']

Output: 0


Input: Consider Input: 3, 4, ['2425', 'J', 'x', '8829', 't', '7927', 'R', 'J', '1599', '3149']

Output: 8829


Input: Consider Input: 17, 18, ['1207', 'R', 'z', '6959', 'T', 'y', 'K', 'p', '6347', 'O', '7993', 'a', 'w', '3925', '6529', '6623', '1523', 'U', 't', '8037', 'Q', '5619', '3411', '8717', '9483', 'O', 'B']


Output: 1523