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:
7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Ex Output:
6189


Ex Input:
2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']

Ex Output:
13630


Ex Input:
13, 16, ['2313', '2565', 'q', '5925', 'E', '1627', '5739', 'v', 'Z', '3915', 'o', 'O', '5669', '6199', '6181', '3499', 't', 'F', 'o', '977', '8239']

Ex Output:

21548