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, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']

Ex Output:
14716


Ex Input:
1, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']

Ex Output:
16375


Ex Input:
6, 13, ['r', '5001', '3329', 'M', 'n', '5051', 'J', 'J', 'P', '7045', 'W', 'W', '5383', 'n', '7137', '7685', 'c', '4239', 'd', 'B', '2365', 'N', 'V', 'M', '3571', 'S']

Ex Output:

17479