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, 25, ['3531', 'd', 'p', '4121', '611', '8373', '7669', 'S', 'o', '4087', 't', '5747', '3619', 'O', 'F', '4065', 'J', 'J', 'q', 'L', 'M', 'J', 'O', '7167', '3165']