{"raw_statement":[{"iden":"statement","content":"Little Toojee was a happy go lucky boy. He seemed to find most, if not all, things funny. One day he read a word and started laughing a lot. Turns out that the word consisted only of the letters L and O. Whenever he saw the subsequence ‘LOL’ in the word, he laughed for 1 second. Given t strings, find out for how long Toojee laughed on seeing each string.\n\nThe first line contains t queries. This is followed by t lines each containing one string S. String S consists only of capital alphabets.\n\nOutput for each string on a new line.\n\n*Constraints* \n\nTest1: On observation, we can tell that there is only 1 occurrence of LOL.\n\nTest2: Let the string be 0-indexed and let V = {a, b, c} denote the indices that make up the string “LOL”, where a is index of the 1st ‘L’, b is index of the ‘O’ and c is the index of the 2nd ‘L’. So, V can be {0, 1, 2}, {2, 3, 4}, {0, 1, 4} and {0, 3, 4}. We see that there are 4 occurrences of the string “LOL”.\n\n"},{"iden":"input","content":"The first line contains t queries. This is followed by t lines each containing one string S. String S consists only of capital alphabets."},{"iden":"output","content":"Output for each string on a new line.*Constraints*   1  ≤  t  ≤  10  1  ≤  |S|  ≤  105 "},{"iden":"examples","content":"Input2LOLLOLOLOutput14"},{"iden":"note","content":"Test1: On observation, we can tell that there is only 1 occurrence of LOL.Test2: Let the string be 0-indexed and let V = {a, b, c} denote the indices that make up the string “LOL”, where a is index of the 1st ‘L’, b is index of the ‘O’ and c is the index of the 2nd ‘L’. So, V can be {0, 1, 2}, {2, 3, 4}, {0, 1, 4} and {0, 3, 4}. We see that there are 4 occurrences of the string “LOL”."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ t \\in \\mathbb{Z} $ be the number of test cases.  \nLet $ S_1, S_2, \\dots, S_t $ be strings over the alphabet $ \\{ \\text{A}, \\text{B}, \\dots, \\text{Z} \\} $.\n\n**Constraints**  \n1. $ 1 \\le t \\le \\text{some upper bound (not specified)} $  \n2. Each string $ S_k $ consists only of uppercase English letters.\n\n**Objective**  \nFor each string $ S_k $, count the number of subsequences equal to \"LOL\", i.e., the number of triples of indices $ (i, j, l) $ such that:  \n- $ i < j < l $,  \n- $ S_k[i] = \\text{'L'} $,  \n- $ S_k[j] = \\text{'O'} $,  \n- $ S_k[l] = \\text{'L'} $.  \n\nOutput the count for each $ S_k $.","simple_statement":"Count how many times \"LOL\" appears as a subsequence in each string. For each string, output the total count.","has_page_source":false}