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.
2, 15, ['i', '721', '7869', 'f', '2857', '971', '5705', '2427', 'I', 'J', 'e', 'q', '1953', 'U', 'r', '9639', '3603', '4849', 'v', '5183', 'T', 'Q', '1131']