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:
6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']

Ex Output:
5231


Ex Input:
1, 9, ['6607', '6185', 'X', 'd', 'T', 't', 'Y', 'p', '2789', 'a', '7365', 'k', 'n', '1853', 'x', 'F', '5523', '2827', '1441', 'F', 'c', 'i', 'n', 'h', '3633']

Ex Output:
15581


Ex Input:
6, 22, ['E', 'u', '4465', '2879', 'a', '6763', 'F', 'l', '8649', 'O', '8451', 'W', '7279', 'N', 'C', 'O', 'f', 'U', 'M', '7285', '667', 't', 'e', '2731', '3693']

Ex Output:

39094