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, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']
[EX A]: 13884

[EX Q]: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
[EX A]: 47509

[EX Q]: 6, 11, ['m', '2835', '4561', '7837', '3337', 'u', 'z', 'p', '4881', '8835', '817', 'h']
[EX A]:
14533