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: 2, 2, ['8149', '7123', 'c', 'X', '1659']

A: 7123
****
Q: 4, 13, ['1821', 'R', 'u', 'j', 'O', '1655', 'T', 'n', '4237', 'v', 'N', 'U', '1593', 'z', 'O', 'K', '4393', 'E', 'E', 'X', 'U']

A:
7485
****