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]: 3, 18, ['5593', '9147', 'F', 'O', '3355', '4669', 'j', '8117', 'I', '6935', 'x', 'Z', 'q', '8919', 'F', 'j', 'z', '215', '1761', 'y', '9889', '5557', 'p', 'm', '9293', '4673', 'X', '9519', '6099']
[A]: 32210


[Q]: 7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']
[A]: 8414


[Q]: 2, 13, ['m', 'C', 'y', '265', '5995', '2991', '3481', '5975', '1317', 'P', 'v', 'q', '5737', 'n', 'k', 't', '6149', '3977', 'V', 's', 'Q', 'E', '2073', '6949', 's', 'f', 'Y']
[A]:
25761