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: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']

A: 17360
****
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, 16, ['8999', '5097', '1081', '2443', '3271', 'l', '3181', '2461', '3059', '3739', 'S', '3761', 'v', '8897', 'G', '4041', '4711', 'v', 'D']

A:
35934
****