#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

int main()
{
    int T; cin>>T;
    while (T--) {
        string s; cin>>s;
        reverse(begin(s), end(s));

        bool res=true;
        vector<int> a;
        for(auto& c: s) {
            if (c=='R') {
                a.push_back(0);
            }
            else {
                int k=c=='W';
                auto t=find(begin(a), end(a), k);
                if (t==end(a) and (!k or find(begin(a), end(a), 2)==end(a)))
                    res=false;
                else
                    *t=k+1;
            }
        }
        if (count(begin(a), end(a), 2)!=a.size()) res=false;

        cout<<(res ? "possible" : "impossible")<<endl;
    }
}