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, 2, ['4319', '3495']

Output: 7814


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

Output: 3201


Input: Consider Input: 6, 15, ['E', 'g', 'h', 'A', 'z', 'F', 'N', 'H', '5273', '4239', '6069', 'e', 'C', '3701', 'W']


Output: 19282