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]: 5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']
[EX A]: 21977

[EX Q]: 1, 14, ['9503', '5983', '143', 'j', '9227', 'g', 'X', '5995', '6623', 'k', 'q', '1047', '2815', '569', 's', 'D', '4045', 'G', '9707', '6707', '7953', 'R']
[EX A]: 41905

[EX Q]: 2, 16, ['3197', '1479', 'k', '7739', 'D', 'l', '7919', 'O', '365', '5213', '1563', 'J', '6403', 'X', '1015', 'A', '3923', 'N', '4451', '8521']
[EX A]:
31696