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, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Ex Output:
719


Ex Input:
2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']

Ex Output:
51416


Ex Input:
4, 10, ['6699', '7853', 'V', '6383', 'K', '2433', '9189', '5109', '6149', '3223', 'F', 'J']

Ex Output:

32486