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.

Ex Input:
9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

Ex Output:
8357


Ex Input:
14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']

Ex Output:
19532


Ex Input:
7, 7, ['P', '4435', '2381', '8157', '4697', '7445', 'H', '8655', '2783', '4313', '1673', 'C', 'W', 'A', 'x', 'g', '7217', 'G', 'j', 'D']

Ex Output:

0