Definition: 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.
Input: 6, 20, ['2209', '8355', 'R', 's', '4073', 'E', 'C', '2623', 'z', '1527', 'X', '4033', 'a', 'W', 'v', 'n', '6355', '2197', '7099', 'J', 'a', '9461', 'k', 'i', '9509', 'y', '5277', '9935', '7649', 'E']

23834