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.
12, 17, ['a', '8275', 'c', 'M', '6199', '7713', '2777', 'X', 'h', '5607', 'Q', '9775', '265', 'u', '4245', 'M', '2757', 'x', 'W', '6389', 'F', 'R']