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, 5, ['5713', 'f', 'g', '9979', '2651', 't', '6513', 'v', '5733', '3325', 'M', 'B', '6139', 'n', 'K', 'h', 'c', '1181', '1263', '6625', 'F', '7059', 'c', '4083', 'i', 'g', '6783']

A: 12630
****
Q: 2, 2, ['5189', 'J']

A: 0
****
Q: 1, 24, ['1561', 'r', 'P', '623', 'k', '9263', 'j', '661', '2753', 'w', '3917', '1605', 'a', 'Y', 'y', 'd', 'k', '5841', 'Z', '547', '4117', '5703', 'r', '9217', 'W']

A:
45808
****