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.

Q: 3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']

A: 9114
****
Q: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']

A: 36328
****
Q: 10, 13, ['2563', '8539', '6343', '2901', '391', '7609', 'A', 'i', 'f', '1481', 'T', 'y', 'H', '8625']

A:
1481
****