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: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Output: 0


Input: Consider Input: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

Output: 19516


Input: Consider Input: 8, 13, ['A', '9099', 'C', '3471', '371', 'C', '1837', '3119', '3833', '9241', 'y', '555', '7083', '4793', 'd', 't', 'D', 'A', 'p', '6407', '4637', '299', '3645', '5171', '6295']


Output: 23831