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.

7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']
0

2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
36626

1, 11, ['y', '6725', 'L', '9983', 'H', '8829', '1259', 'Y', '7355', '4277', '3769', '267', 'b', '9413', '6315', '4927', 'h', 'Y', '2707', '3645', '8133', 'X', '1595', 'j']

42197