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:
4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Ex Output:
10432


Ex Input:
1, 2, ['j', '3613']

Ex Output:
3613


Ex Input:
17, 18, ['3683', '3481', '8461', '4373', '7275', 'O', 'x', '7177', 'c', '1105', '7095', 'j', 'z', '3147', 'z', '5053', '957', 'X', 'P', '8945', '5053']

Ex Output:

957