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, 17, ['e', 'A', '5601', '9061', 'A', '9481', '4749', '2365', 'd', '1467', '6407', '4555', '719', 'p', '5017', 'I', 'e', '6967', '2263', '5569', 'V', 'Y', 'h']