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, 2, ['4965', '6219']

Ex Output:
6219


Ex Input:
1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

Ex Output:
2957


Ex Input:
20, 26, ['5313', 'E', '4417', 'c', 'e', '9361', '7903', 'G', '6689', 'v', '5391', 'z', 'b', '1417', 'y', 'Q', 'M', 'Y', '9485', 'I', '883', '8913', '9917', '9351', 'N', 'P', '319', 'y', '6483']

Ex Output:

29064