Structuring the Document C

Problem Statement :

A document is represented as a collection paragraphs, a paragraph is represented as a collection of sentences, a sentence is represented as a collection of words and a word is represented as a collection of lower-case ([a-z]) and upper-case ([A-Z]) English characters.

You will convert a raw text document into its component paragraphs, sentences and words. To test your results, queries will ask you to return a specific paragraph, sentence or word as described below.

Alicia is studying the C programming language at the University of Dunkirk and she represents the words, sentences, paragraphs, and documents using pointers:

    A word is described by  char * .
    A sentence is described by char **  . The words in the sentence are separated by one space (" "). The last word does not end with a space(" ").
    A paragraph is described by char *** . The sentences in the paragraph are separated by one period (".").
   A document is described by char ****  . The paragraphs in the document are separated by one newline("\n"). The last paragraph does not end with a newline.

For example:

    Learning C is fun.
    Learning pointers is more fun.It is good to have pointers.

    The only sentence in the first paragraph could be represented as:

char** first_sentence_in_first_paragraph = {"Learning", "C", "is", "fun"};

    The first paragraph itself could be represented as:

char*** first_paragraph = {{"Learning", "C", "is", "fun"}};

    The first sentence in the second paragraph could be represented as:

char** first_sentence_in_second_paragraph = {"Learning", "pointers", "is", "more", "fun"};

    The second sentence in the second paragraph could be represented as:

char** second_sentence_in_second_paragraph = {"It", "is", "good", "to", "have", "pointers"};

    The second paragraph could be represented as:

char*** second_paragraph = {{"Learning", "pointers", "is", "more", "fun"}, {"It", "is", "good", "to", "have", "pointers"}};

    Finally, the document could be represented as:

char**** document = {{{"Learning", "C", "is", "fun"}}, {{"Learning", "pointers", "is", "more", "fun"}, {"It", "is", "good", "to", "have", "pointers"}}};

The first line contains the integer  paragraph_count. 
Each of the next paragraph_count lines contains a paragraph as a single string.
The next line contains the integer q, the number of queries.
Each of the next q lines or groups of lines contains a query in one of the following formats: 

1 The first line contains 1 k :

    The next line contains an integer  x , the number of sentences in the kth paragraph.
    Each of the next x lines contains an integer a[i], the number of words in the ith sentence.
    This query corresponds to calling the function kth_paragraph. 

2 The first line contains 2 k m:

    The next line contains an integer  x , the number of words in the kth sentence of the mth paragraph.
    This query corresponds to calling the function kth_sentence_in_mth_paragraph. 

3 The only line contains 3 k m n:

    This query corresponds to calling the function kth_word_in_mth_sentence_of_nth_paragraph.

Constraints

    The text which is passed to the get_document has words separated by a space (" "), sentences separated by a period (".") and paragraphs separated by a newline("\n").
    The last word in a sentence does not end with a space.
    The last paragraph does not end with a newline.
    The words contain only upper-case and lower-case English letters.
    1 <= number of characters in the entire document <= 1000
    1 <= number of paragraphs in the entire document <= 5

Output Format

Print the paragraph, sentence or the word corresponding to the query to check the logic of your code.