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, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
[A]: 26847


[Q]: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
[A]: 5430


[Q]: 7, 11, ['8019', 'A', 'D', 'x', '9843', '5381', '5305', '6257', 'p', 'q', '7605', 'e', 'k', 'Q', 'I', '7023', '7939', '6093', 'K']
[A]:
19167