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, 2, ['4857', '6373']
[EX A]: 11230

[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]: 11, 18, ['9805', '6855', '7019', '3855', '1267', '6195', 'D', '1649', 'D', 'a', '9493', '1903', 'P', '505', '569', 'M', '4349', 'n', '4837', 'n', 'F', 'z', 'z', 'g']
[EX A]:
16819