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: 1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']

A: 23479
****
Q: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

A: 8825
****
Q: 10, 15, ['8875', 'n', '5449', 'l', 'b', '835', 'K', 'f', '2677', '7457', 'M', '9437', '3589', 'p', 'P', 'X', 'W', '4033', 'M', 'H', 'Z', '2313', 'o', 'h', 'V']

A:
20483
****