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]: 1, 1, ['2821', '3823', '9741', 'k', 'X', '2457']
[A]: 2821


[Q]: 5, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']
[A]: 10531


[Q]: 4, 12, ['M', '3505', '1337', '9561', '9999', '5521', 'W', 'v', 'y', 't', 'H', '4373', '8243', 'R', '9131', 'O', '5375', 'Q', '7347']
[A]:
29454