As programmers say: Strive to be lazy Story
Have you seen this post from 9gag?
Maybe you got the feeling to make your own sentences. But then you realize that you could just golf a script in half an hour, and you will never have to deal time with that.
The submission
Your program will get an input string which it will return with added quotation marks as explained below.
Standard loopholes are forbidden. Output as a list of lines is allowed. Trailing spaces and empty lines that don't break the output are allowed.
The rules of input

The input only contains printable ASCII characters.
The input may contain spaces. The words are determined with them.
It's guaranteed that a space will never be followed by another space.
The case of no input or empty string doesn't matter.

The rules of output
If one word is given then the program has to return the string between quotation marks.
If the input string has 2 or more words, it first returns the initial input, but the first word is in quotation marks. Then on the next line, it returns the initial input, but with the second word in quotes. And so on for the remaining words.
In general, the program has to return as many lines as there are words in the input.
Examples:
test -&gt; &quot;test&quot;

This is codegolf -&gt; &quot;This&quot; is codegolf
                    This &quot;is&quot; codegolf
                    This is &quot;codegolf&quot;

This is a significantly longer, but not the longest testcase -&gt; &quot;This&quot; is a significantly longer, but not the longest testcase
                                                                This &quot;is&quot; a significantly longer, but not the longest testcase
                                                                This is &quot;a&quot; significantly longer, but not the longest testcase
                                                                This is a &quot;significantly&quot; longer, but not the longest testcase
                                                                This is a significantly &quot;longer,&quot; but not the longest testcase
                                                                This is a significantly longer, &quot;but&quot; not the longest testcase
                                                                This is a significantly longer, but &quot;not&quot; the longest testcase
                                                                This is a significantly longer, but not &quot;the&quot; longest testcase
                                                                This is a significantly longer, but not the &quot;longest&quot; testcase
                                                                This is a significantly longer, but not the longest &quot;testcase&quot;

Here is an another one -&gt; &quot;Here&quot; is an another one
                          Here &quot;is&quot; an another one
                          Here is &quot;an&quot; another one
                          Here is an &quot;another&quot; one
                          Here is an another &quot;one&quot;

This is code-golf, so the least byte answer wins!
vim, 38 bytes

:s/"/&lt;C-d&gt;/g
qqysW"Ypds"W@qq@qdk:%s/&lt;C-d&gt;/"/g



Try it online!

Requires the vim-surround plugin.

If the input does not contain " characters, this can be done in 19 bytes:

qqysW"Ypds"W@qq@qdk


Here, we record a recursive macro (qq ... @qq@q) that surrounds a word with quotation marks (ysW"), duplicates the line (Yp), deletes the quotation marks (ds"), and moves to the next word (W) before calling itself recursively. After it terminates, there are two extraneous lines, which are deleted with dk.

The full solution simply wraps this with :s/"/&lt;C-d&gt;/g at the beginning, which replaces existing " characters with an unprintable character, and :%s/&lt;C-d&gt;/"/g at the end, which undoes the replacement.