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.
20, 21, ['N', '5351', '7473', '8057', '969', '5125', 'Y', 'E', 'Y', '881', '8929', '307', 'e', 'H', 'z', '2619', '5747', 'g', 'G', '7503', 'K', '1843', '2893', 'H', 'D']