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.

Example Input: 3, 18, ['P', '1429', '3883', '1883', 'u', 'K', 'N', 'j', 'u', 'H', 'y', '7785', '7371', '6869', '1613', '6515', '695', 'U', 'u']
Example Output: 36614

Example Input: 2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
Example Output: 13630

Example Input: 12, 20, ['8137', '9761', '2331', '9799', 'M', '2257', '9985', 'B', 't', '6079', '8559', 'm', '799', '1297', 'Q', '9249', '3813', 'L', 'B', 'I', '1687', 'B', '3763', 'S', 'F', 'R', '3343']
Example Output:
15158