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]: 19, 19, ['4147', '1103', '5749', 'c', '5103', '3491', '4511', '197', 'T', '1601', 'J', 'c', '1309', 'a', '607', 'p', 'C', '9473', '5221', 'D', 'U', 'O', '5013']
[A]: 5221


[Q]: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']
[A]: 8825


[Q]: 3, 9, ['R', '9539', '7621', '591', '2561', '2225', '1701', '7725', '2651', '6229', 'v']
[A]:
25075