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, 21, ['n', 'j', 'Q', 'C', '1501', 'B', 'D', 'm', 'O', 'K', '283', '8991', '5285', '1903', '4331', 'R', '1489', 'N', '4291', 'c', '1563', 'u', '5151', '7937', 'a', '5293', '4259', 'y', '385', 'Z']