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]: 6, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']
[EX A]: 25653

[EX Q]: 1, 1, ['1449', '1257']
[EX A]: 1449

[EX Q]: 2, 3, ['q', 's', 'f', 'E', '6269', 'h', 'e', '5255', '1271', '543', '3003', 'd', 'q', '9931', '8333', '2033', 'Q', '5707', 'g', '2021', '6595']
[EX A]:
0