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: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']

A: 28382
****
Q: 1, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']

A: 44271
****
Q: 4, 23, ['9405', '8043', '4177', 'O', '2139', '3665', '7245', '2637', 'D', '3527', '5271', 'R', '437', 'n', '9705', 'w', '5097', 's', 'Y', '9019', 'I', 'p', 'F', '4559', '155', '7031', '3355']

A:
48742
****