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, 15, ['8889', 'f', 'X', '7767', '1601', '707', 't', 'B', '1081', '3383', '4237', 'H', 'j', '5805', '4035', '195', '6923', '7945', '95', '2511', '4399', 'x', '8353', '7009', 'd', '8215']