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:
5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']

Ex Output:
20869


Ex Input:
2, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']

Ex Output:
21013


Ex Input:
9, 9, ['D', '3707', '8445', 'E', '5113', 'V', 'p', '8551', '9919', 'Y', 'E', '5055', 'x', '3915', 'K', '9121', '3451', '497', '4873', 'V']

Ex Output:

9919