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, 2, ['j', '3613']

Ex Output:
3613


Ex Input:
21, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']

Ex Output:
11368


Ex Input:
13, 16, ['9655', 'y', '5541', 'n', 'H', '2033', '6449', '1151', '6565', '1643', 'a', 'N', '415', 'z', '7727', '7671', '5723', '5701', '4861', '269', 'T', 'G', 'W']

Ex Output:

15813