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: 2, 20, ['4115', 'o', 'G', 'f', 'v', '9897', '9831', '4387', 'o', '6101', 'l', 'e', '2569', 'j', 'g', 'f', 'f', 'v', 'A', 'x', '5475', 'P', '2695', '4303']

32785