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, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']
[A]: 5909


[Q]: 10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']
[A]: 8889


[Q]: 3, 5, ['K', 'o', '9575', 'r', '3961', '7817', 'E', '8609', 'D', '4183', 'i', '9935', 'n', '3815', '5407', 'z', 'D']
[A]:
13536