#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


char s[N];
void solve() {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    for (int i = 1; i + 2 <= n; i++)
        if (s[i] == 'S' && s[i + 1] == 'K' && s[i + 2] == 'G') {
            puts("No");
            return;
        }
    for (int i = 1; i < n + 1; i++)
        if (s[i] == '.') {
            if (s[i - 1] != 'S') s[i] = 'K';
            else if (i < 3 || s[i - 1] != 'K' || s[i - 2] != 'S') s[i] = 'G';
            else s[i] = 'S';
        }
    puts("Yes");
    puts(s + 1);
}

int main() {
    int T = 1;
    scanf("%d", &T);
    while (T--) solve();
    using namespace std;
    return 0;
}