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: 9, 12, ['g', '3735', '5873', '6811', 't', '6787', '2171', '8913', '9219', '6427', 'P', 'w', 'r', '1739', '5271', 'A', 'l', '3487', '7261', '9515', '3127', 's', '4883', '8479', 'O', '2251', 'W', 'B', 'D', '6979']

15646