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, 6, ['937', '3595', '1279', '8705', '3587', '5879']

Ex Output:
9466


Ex Input:
2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']

Ex Output:
19665


Ex Input:
1, 9, ['1777', 'F', '7621', '1011', '563', '2273', 'A', '1093', 'I', 'M', '5811', '1667']

Ex Output:

14338