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.
18, 30, ['7361', 'X', '6431', '3203', '4861', 'w', 'j', '7001', 'T', '5045', '7305', '429', 'w', 'S', '2395', 'l', '4071', '9833', '8251', '5507', '9133', 'r', 'A', '5669', '7625', '3305', '343', '7155', 'f', '8207']