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, ['T', '687', '325', '1413', 'P', '9065', 'K', 'u', 'e', '6661', '5367', 'A', 'F', 'w', 'T', '9089', 'd', 'O', 'h', '5649', '6615', 'j', 'd', 'Y', '1579', 'w', '9397', '5039', '883', '6889']