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: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']

A: 9892
****
Q: 5, 18, ['T', '7117', '7067', 't', '7083', '5711', '6735', 's', '4879', '2553', 'a', 'z', 'Q', '4759', '6243', 'k', 'V', '7803', '2489', 'j', '9449', '8017', '9739', 'F', '1557']

A: 45766
****
Q: 8, 9, ['q', 'l', 'Q', 'U', 'w', '1715', '2639', 'o', '4537', '6615', '5759', 'J', '5943', '309', '3013', 'm']

A:
4537
****