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]: 2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']
[EX A]: 4591

[EX Q]: 6, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']
[EX A]: 4515

[EX Q]: 7, 11, ['l', '2013', '6005', 'Y', 'G', '1687', 'd', 'A', 'a', '5947', '9837', 'r', 'h', '257', '7943']
[EX A]:
15784