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, 12, ['2337', 'A', 'j', 'p', 'c', 'k', 'Y', 'Q', 'N', 'L', '8857', '9985', 'N', 'x', 'u']

Output: 18842


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: 12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']


Output: 13602