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, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']

Output: 32007


Input: Consider Input: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Output: 3932


Input: Consider Input: 4, 8, ['3881', 'v', 'W', 'c', 'r', '3139', '7465', '9867', '7141', 'k', 'd', 'L', '4033', 'L', 'e', 'E', 'L', '1719', 'A', '5231', 'Y', '15', 's', '657', '4279', 'l', '6645', '2667', '3983']


Output: 20471