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.

[Q]: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']
[A]: 4364


[Q]: 11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']
[A]: 26378


[Q]: 3, 11, ['j', '6735', '1087', 'i', '5295', '8167', '6151', '8241', '7355', 'r', 'e']
[A]:
36296