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: 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: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

A: 9511
****
Q: 12, 19, ['8101', '6977', '2259', '2655', '173', '3111', '5069', 'E', '3397', 'f', '8517', '7371', 'f', '5369', 'y', 'Q', 'n', 'Z', '4655', 'a', 'M', 'g', '4237', 'x', 'B', '7401', 'n']

A:
17395
****