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:
3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']

Ex Output:
38666


Ex Input:
11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']

Ex Output:
6094


Ex Input:
13, 18, ['7093', 'i', '3651', 'K', 'F', 'u', 'D', 'F', '6165', 'I', 'i', '1849', 'O', 'R', '1409', 'a', '9697', 'i', 'p', '2237', 'j', 'q', 'D', '551', '4811']

Ex Output:

11106