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, ['Z', 'X', 't']

Output: 0


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

Output: 8829


Input: Consider Input: 4, 12, ['187', '3975', 'H', 'i', 'd', 'u', '7811', '3735', 'B', '7417', 'A', 'z', '2037', '7781', '9143', '7909', 'x', 'u', '6029', '1971', '6925', 'Y', 'v', '8151', '3181', '475', 'o', 'D', '2723', 'g']


Output: 18963