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: 2, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']
Example Output: 17607

Example Input: 11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']
Example Output: 3469

Example Input: 9, 14, ['E', '4167', 'q', 'y', '4755', '1777', 'm', 'u', 'g', 'M', 'F', '6475', '8491', '3615']
Example Output:
18581