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, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

A: 12664
****
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: 1, 15, ['4569', 'k', 'j', 't', '3735', '1773', 'z', 'b', 'P', '3445', '3491', '8759', 's', '7245', '9405', '3251', 'J', '887', '8975', 'z', '3953']

A:
42422
****