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: 22, 25, ['681', '2393', 'f', 'g', '5051', '5839', 'T', 'p', '8057', '6929', 'N', '1519', 'G', '8969', '8589', 'T', 't', '4915', 'r', 'M', 'N', '8285', '8607', '4333', '7457', '343', 'f', 'r']

A: 28682
****
Q: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']

A: 27156
****
Q: 1, 5, ['H', '3513', '7631', '5627', 'W', '7717']

A:
16771
****