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:
5, 10, ['8553', '4157', 'm', 'Q', 'u', 'j', 'X', 'r', '8579', '255', 'A', 'g', '7017', '5707', 'd', 'O', 'V', 's', 'p', '337', 'F', '5439', '5715', 'c', '2615', 'l', '3537']

Ex Output:
8834


Ex Input:
5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']

Ex Output:
19814


Ex Input:
1, 15, ['7431', '8517', '5811', 'J', '1929', 'k', 'Y', '9677', 'b', '5769', '5923', 'M', '5695', '4503', '1383', '557', 'i', 'e']

Ex Output:

56638