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.
15, 25, ['Y', '2539', 'B', 'Q', 'M', 'H', 'r', 's', '5577', 'Y', 'X', '6419', 'b', 'H', '4237', '5329', 'Q', 'S', 'X', '9677', 'P', '2347', 'H', '213', 'Q']