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:
5, 16, ['t', 'r', 'O', 'q', 'B', '6327', 'f', 'R', 'H', '4429', 'o', '5347', 'U', 'h', '7067', '237', 'i', 'k', 'K', '461', 'L', '4105', 'i', '6483']

Ex Output:
23407


Ex Input:
3, 3, ['9881', 'p', 'i', '757', 'N', 'n', 'E', 'c', '3583', 'M', '8593', 'l', 'V', 'g', 'n', '7461', '1147', '2023', 'Z', '9443', '8459', 's', '903', 'Q']

Ex Output:

0