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: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']

A: 7720
****
Q: 4, 25, ['H', '501', 'F', '4923', 'C', 'T', 'R', 'b', 'Z', 'e', 'i', 'H', '755', '6503', '2825', 'H', '1995', '7283', '2735', '4433', 's', 'P', '795', 'Z', 'Z']

A: 32247
****
Q: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

A:
6175
****