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:
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:
5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

Ex Output:
5573


Ex Input:
2, 4, ['B', '9113', '2027', '583', '4231', 'v', 'I', '8383']

Ex Output:

11723