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:
2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

Ex Output:
10497


Ex Input:
18, 24, ['1855', '3847', '5903', '8967', '4815', '9813', '1563', 'H', 'i', '5755', '2051', '6145', '5863', '2921', '9589', '7223', 'E', '3193', 'n', '7727', 'C', '6095', '7747', '7407']

Ex Output:

32169