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, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
[A]: 0


[Q]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[A]: 9035


[Q]: 19, 25, ['i', 'i', 'n', 'P', '9567', '1779', '8421', '6875', '767', 'J', '9317', '4291', '8549', '3041', '1661', 'z', 'z', '7711', 'p', '4177', '8817', '8139', 'J', '1689', '6189', 'k', 'O', '2523', 'f']
[A]:
29011