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]: 4, 22, ['B', 'I', '5423', '9395', '6733', '8815', 'A', 'o', '3809', '7385', 'z', 'Y', 'r', 'b', '903', 'k', '5975', '6687', 'K', '3971', 'r', '9579', 'F', '3705', 'X', 'E', '6071', '8277', '5397']
[EX A]: 63252

[EX Q]: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']
[EX A]: 655

[EX Q]: 5, 13, ['261', 'f', '4459', '1673', '3155', '4473', '2975', 'V', '995', '9317', 't', '2189', '7763', '7065', '6351', 'A']
[EX A]:
30867