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:
13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']

Ex Output:
17796


Ex Input:
2, 2, ['5189', 'J']

Ex Output:
0


Ex Input:
10, 28, ['7369', '7233', 'P', '1815', 'd', '4675', '1271', '9657', 'R', '9613', '7575', '411', '9923', 'h', 'U', 'i', 'e', 'U', 'm', 'D', 'd', 'V', 'H', '7779', '1731', '9325', 'H', 'P']

Ex Output:

46357