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:
3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Ex Output:
4477


Ex Input:
1, 4, ['3757', 'z', '9029', '6903', '7185']

Ex Output:
19689


Ex Input:
1, 7, ['D', 'k', '2867', '6703', '3555', '1423', 'f', '2827', '7659']

Ex Output:

14548