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, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']

Ex Output:
22848


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:
11, 18, ['6533', 'C', '1311', '1881', '1191', 'p', 'c', '5649', 'r', '6419', 'v', 'N', '543', '9453', 'y', 'k', 'J', 'y', '1525', '429', '2397', '6437', '7625', '2293', 'f', 'K']

Ex Output:

9996