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:
1, 6, ['S', 'i', 'F', 'w', '6345', 'L', '9727', 'u', 'F', '7911', 'K', '3151', '6181', 'N', 'a']

Ex Output:
6345


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

Ex Output:
4477


Ex Input:
5, 6, ['605', 'G', '5167', 'u', '923', '6973', '8469', 'Q', '4435', 'Y', 'q', 'S', 'K', '2341', 'F', 'I']

Ex Output:

7896