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:
3, 5, ['i', 'e', '6583', '313', '5511']

Ex Output:
12407


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, 23, ['C', '5003', 'v', '5407', '8393', 'Z', '2507', 'T', '9545', '6413', '4285', 'O', 'O', '3631', '5005', '2975', '7351', '7805', '8553', '6549', 'v', '9697', 'H', '8655', 'T', 'I', '2667']

Ex Output:

93119