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, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
[EX A]: 36328

[EX Q]: 2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']
[EX A]: 19665

[EX Q]: 4, 14, ['3993', '3347', 'k', '8995', 'U', '9017', '5465', '2561', '7913', '7085', 'e', '1787', 'h', 'l', '7037', 'u', 'N', 'g', 'y', '2481', 'e', '5423']
[EX A]:
42823