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: 1, 5, ['5033', '343', 'g', 'q', 'D', '4011', 'Z', '7925', '4297', '1155', '3967', 'e', 'E', 'c', 'I', 'B', '4985', 'B', 'i', '4707', '7205', 'M', 's', 'i', '5121', 'p']

A: 5376
****
Q: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

A: 11880
****
Q: 2, 9, ['7921', 'I', '8005', 'q', 'i', '4947', 'e', 'R', 'x']

A:
12952
****