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]: 7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']
[EX A]: 8414

[EX Q]: 12, 20, ['V', 'H', '5509', 'J', '887', '6361', '4273', '1017', '5167', 'G', 'g', '5185', '2617', 'h', 'Y', '7697', '5075', 'F', '2675', '29', 'K', '2081', 'R', '7011']
[EX A]: 23278

[EX Q]: 3, 4, ['u', 'j', 'q', '7443', '3549', '7543']
[EX A]:
7443