|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
Given an integer N. The task is to print "GeeksforGeeks" N times (without quotes). Every time "GeeksforGeeks" will be printed on a new line.
The first line contains a single integer T i.e. the number of test cases. Each test case contains a single integer N representing number of times the string "GeeksforGeeks" will be printed.
Corresponding to each test case, print "GeeksforGeeks" N times (without quotes), every time on a new line.