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]: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
[EX A]: 0

[EX Q]: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
[EX A]: 34908

[EX Q]: 2, 4, ['E', '4319', '6657', 'L', '3833', 'N', '3167', '325', '877', '1093', '557', 'D', '3669', 'T', '2703', 'H', '937', '8385', '4307', '793', 'h', 'j', 'v']
[EX A]:
10976