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: 4, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']

Output: 6345


Input: Consider Input: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

Output: 3201


Input: Consider Input: 1, 2, ['4807', 'p', 'Z', '7311', 'l', '5939', 'b', '3529', '4201', '2445', 'w', 'A', '2883', '4085', 'y']


Output: 4807