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]: 10, 27, ['Y', 'Q', 'o', '9581', '2725', 'd', '8857', '1477', '2451', '8595', 'I', 'I', '4883', '3781', 'E', '9539', 'k', '1245', '6741', '2051', 'l', '5245', 'e', '6949', '4361', 'U', 'I', 'J', '7867', '991']
[EX A]: 53390

[EX Q]: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']
[EX A]: 28431

[EX Q]: 1, 11, ['x', '6883', 'f', '457', '207', 'p', 'J', 'j', '8007', '3495', 'M', 'E', '4859', 'R', 'V', '2261', 'a', 'e', '6959', '2347', '683', 'L', '1469', 'U', 'h', 'I']
[EX A]:
19049