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, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

Ex Output:
14032


Ex Input:
17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']

Ex Output:
14824


Ex Input:
7, 9, ['R', 'F', '5285', 'x', '5899', '5937', 'n', 'r', '1351', '7569']

Ex Output:

1351