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, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']
[EX A]: 5909

[EX Q]: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']
[EX A]: 6078

[EX Q]: 4, 14, ['z', 'W', 'R', 'E', '6363', '489', 'd', '1349', '6863', 'e', 'j', '7551', 'a', '1253', 'e', '1663', '6241', '4877']
[EX A]:
23868