for _ in range(int(input())):
n, k = list(map(int, input().split()))
a = ''
for i in range(n):
if i % 3 == 0:
a += 'a'
elif i % 3 == 1:
a += 'b'
else:
a += 'c'
print(a)//阶梯式的自由元不在最后几行
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define double long double
const ll N = 2e5+9 ;
const ll INF = 1e18 ;
const ll mod = 1e9 ;
//const double pi = acos(-1) ;
const double eps = 1e-9 ;
ll gcd( ll a , ll b ){ return a == 0 ? b : gcd( b%a , a ) ; }
ll lcm( ll a , ll b ){ return (a/gcd(a,b))*b ; }
void solve(){
ll n , m ; cin >> n >> m ;
for( int i = 0 ; i < n ; i ++ ){
if( i%3 == 0 ) cout << 'a' ;
if( i%3 == 1 ) cout << 'b' ;
if( i%3 == 2 ) cout << 'c' ;
}
cout << "\n" ;
}
int main(){
ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
ll tt = 1 ; cin >> tt ;
while( tt-- ) solve() ;
return 0 ;
}
/*
3 3
1 1 0
0 1 1
1 1 1
*/
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |