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, 5, ['u', 'Y', '4165', '1421', '7617']

Ex Output:
13203


Ex Input:
1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']

Ex Output:
24200


Ex Input:
2, 3, ['9273', '3553', 'E', 'P', 'E', 'C', '9029', 'C', '4191', 'Q', '5373', '2409', '9519', 'd', '8693', 'c', '8113', 'y', '4741', '1039']

Ex Output:

3553