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: Consider Input: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

Output: 30392


Input: Consider Input: 6, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']

Output: 31505


Input: Consider Input: 3, 11, ['7017', '6861', '7335', '9005', 'q', 'G', '4365', 'R', 'L', 'g', '2915', 'd']


Output: 23620