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, 12, ['I', 'S', '4619', 'B', '3489', '9473', '8851', 'V', 'm', 'W', '1939', 'I', 'Y', '1081', 'R', '5755', 'b', '3215', 'q', 'R']