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:
8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

Ex Output:
1930


Ex Input:
3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Ex Output:
4477


Ex Input:
3, 20, ['K', 'Y', 'j', '3157', 'm', '8955', 'n', 'n', '4133', '1453', 'e', '2487', 'B', 'P', '8119', 'h', '1397', '2945', 'M', 'H']

Ex Output:

32646