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]: 2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']
[A]: 9385


[Q]: 5, 10, ['7435', 'B', '7841', '5901', 'I', '6255', 'g', 'F', 'D', '1839', '3651', 'Q', '1629', 'T', '3423', 'y', '9597', '8453', '8541', 'a', '357', 'k', 'P']
[A]: 8094


[Q]: 9, 12, ['k', 'F', 'L', '1567', '9943', '8043', '7571', '3095', 'D', 'v', 'w', '9571', 'Z', '5727', 's', 'i', '9623', '6781']
[A]:
9571