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: 5, 6, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']

A: 2029
****
Q: 4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

A: 32351
****
Q: 6, 21, ['233', '5393', 'r', 'O', '7979', '7679', '3121', 'f', '9291', 'S', 'T', 'b', 'D', '335', 'L', '7619', 'W', '8379', 'p', 'd', 'o', 'c', 'o']

A:
36424
****