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]: 2, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']
[EX A]: 50126

[EX Q]: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[EX A]: 28546

[EX Q]: 9, 13, ['7711', 'j', 'P', '7347', 'd', '3483', '9541', '607', '9821', 'P', '8939', '8835', '5257', 'V', '261', '3219', '3205', '9651', '3197']
[EX A]:
32852