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]: 1, 4, ['1261', 't', 'h', '3615', '7919', 'k']
[EX A]: 4876

[EX Q]: 2, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']
[EX A]: 19369

[EX Q]: 6, 7, ['697', '291', '9973', '4557', 'C', '1617', 'H', 'r', '9085', '2757']
[EX A]:
1617