A good string is a string or a substring that starts with the character " g " and ends with the character " q ". For a given string, write a program to find the number of "good substrings" of a given string. Note - A substring of a string is a contiguous subsequence of that string. The list of all non-empty substrings of the string "apple" would be "apple", "appl", "pple", "app", "ppl", "ple", "ap", "pp", "pl", "le", "a", "p", "p", "I", and "e" There will be multiple test cases running so the Input and Output should match exactly as provided. The base output variable result is set to a default value of 404 which can be modified. Additionally, you can add or remove these output variables. Input Format The first line contains the string S. Sample Input godk .. denotes 5 Constraints 1