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.

[EX Q]: 4, 5, ['b', 'u', '5279', '6945', '6631']
[EX A]: 13576

[EX Q]: 2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']
[EX A]: 9829

[EX Q]: 5, 11, ['J', '8661', '9985', '9365', '2545', '9897', '9113', 'z', '3993', '7521', '6457', '4673', 'v', '9103', 'N', '6823', 'p', 'D', '3087', '2861', 'Q', '9757', '3485', '8647']
[EX A]:
39526