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:
16, 23, ['g', 'p', '7457', 'l', 'a', 'a', 'C', '6307', 'G', '5453', '1165', 'W', '6419', 's', '9445', 'y', 'Y', 'F', '9703', '4049', 'Y', '7173', 's', '7925', 'Z', '4413', 'd', '649']

Ex Output:
20925


Ex Input:
14, 26, ['U', 'D', '5391', '2975', 'b', 'b', '8741', '8991', '9083', '5401', '481', 'q', 'j', '8757', 'C', '2027', '6683', '5667', 'R', '631', 'm', '3743', '9769', '1039', '923', 'Q', '4373', '7451']

Ex Output:
39239


Ex Input:
5, 19, ['6977', '3053', 'V', '7449', '1033', 'E', '501', 'y', '6103', '3227', 'z', 'x', '861', '3693', '6309', '627', '2671', '5053', 'x', 'h']

Ex Output:

30078