def solve():
l = list(map(int,input().split()))
n = int(input())
sizes = ["S","M","L","XL","XXL"]
def get_tshirt(num):
if num < 0 or num >= 5 or l[num] == 0:
return False
else:
print(sizes[num])
l[num] = l[num] - 1
return True
for _ in range(n):
sz = input().strip()
i = sizes.index(sz)
if l[i] > 0: print(sz)
l[i] -= 1
else: for j in range(1, 5):
if get_tshirt(i+j) or get_tshirt(i-j):
break
solve()#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
string s[5]={"S","M","L","XL","XXL"};
int num[5];
for(int i=0; i<5; i++){
cin>>num[i];
}
int n,j;
cin>>n;
string t;
for(int i=0; i<n; i++){
cin>>t;
for(j=0; j<5; j++){
if(s[j]==t) break;
}
for(int k=0; k<5; k++){
if(j+k<5&&num[j+k]){
cout<<s[j+k]<<endl;
num[j+k]--;
break;
}
else if(j-k>=0&&num[j-k]){
cout<<s[j-k]<<endl;
num[j-k]--;
break;
}
}
}
}
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |
1296B - Food Buying | 133A - HQ9+ |