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:
2, 8, ['3651', '6881', '3701', 'M', '8543', '5995', 'q', 'A', 'S', '745']

Ex Output:
25120


Ex Input:
2, 12, ['Y', '5063', 'S', 'u', 'k', 'i', '7319', '6513', '9547', '6537', 'h', '6079', '8767', '2057', '1063', 'l']

Ex Output:
41058


Ex Input:
7, 9, ['f', 'Q', 'm', 'n', 'R', '2307', '4047', 'L', '7061', '7967', '2307', 's', 'y', 'f', '9677', 'I', '695', 'q', 'q']

Ex Output:

11108