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.
8, 11, ['4111', '1379', '649', 'd', '4451', '999', '4413', '1335', 'c', 'r', '3733', '339', '4025', 'I', 'k', 'd', 'd', '9529', 'X', '2949', 'd', '2557', 'N', 'U', '6475']