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, 2, ['4965', '6219']

A: 6219
****
Q: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']

A: 15772
****
Q: 9, 25, ['8027', 'p', 't', '8395', '7627', '7899', '141', '3665', 'A', 'g', 'E', 'Q', 'u', '1145', '1103', '1211', '7383', '2491', '7177', '29', '3683', 'i', 'O', '867', '8987', '1609']

A:
34076
****