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, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']

Output: 19785


Input: Consider Input: 6, 8, ['u', 'Q', '1695', 'n', '6387', '3361', 'l', '985', 's', '6515', 'G', '7351', '8061', '9449', 'M', 'H', '8771', 'f']


Output: 4346