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.

5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']
4571

5, 6, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']
2029

3, 5, ['P', '7389', '3033', '2569', '927']

6529