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.
1, 9, ['8547', 'J', 'R', 'J', 'S', 'S', '1841', 'Z', '9289', '7733', '6001', 't', '6387', '9271', '3645', 'I', '3355', '2215', 'd', 'T', '6315', '6695', 'Q', '97', 'U', '453', 'e']