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, ['O', 'T', 'V', '9035', 'L', 't', 'I']

A: 9035
****
Q: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']

A: 38666
****
Q: 8, 12, ['257', '6583', '193', 'g', 'U', 'Z', 'O', '9755', 'Y', 'K', '901', '1103', '2659', 's', 'D', '6265', 'R', 'F']

A:
11759
****