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]: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']
[A]: 26471


[Q]: 5, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']
[A]: 13127


[Q]: 4, 13, ['6009', '5137', '4093', 'G', 'J', '8887', '425', '8977', 'Y', 'e', '5799', 't', '2801', '4905', 'D', '6627', '7151', '6611', 'U', 'w', '6123', 'R', '1583']
[A]:
26889