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.
11, 20, ['1101', '4623', 'A', '9195', '8159', '1509', 'u', '8517', '657', 'S', 'r', '5195', '1981', 'B', '6485', 'd', 'm', '5233', '5035', 'm', 'g', '5211', 'G', 'c', 'g', 'g', '8623', '7765', 'l']