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]: 12, 14, ['6255', 'M', '3541', 'A', 'I', 'W', '2289', '9861', 'L', '2527', 'h', '355', '7033', 'p', 'f']
[EX A]: 7388

[EX Q]: 13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']
[EX A]: 17796

[EX Q]: 1, 8, ['x', 'J', '9995', 'e', 'M', 'E', 'M', '1125', 'V', '5325', '2909', 's', '5361', 'i', 'J', '7897', 'T', '3357', '2473', '7261', 'Q', '25', 'j', '9257', '8109', 'J', 'E']
[EX A]:
11120