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.
9, 12, ['5135', 'D', '915', '5361', '2815', 'Y', 'E', '4273', 'q', '8079', '9567', 'p', 'p', 's', '337', 'a', 'j', 'E', '1555', '8909', '453']