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.

3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
283

4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
21080

8, 17, ['6355', 'x', 'h', '9771', 'P', 'f', '3201', '3171', 'S', '8687', 'Y', 'D', 'B', '4347', '7371', 'd', 'S', 'i', 'G', '4835', 'K', 'I', 'v', 'i', '5847', '9535', 'W', '1287', '3289', 'j']

23576