#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <assert.h>
#include <bitset>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

bool check(std::string s) {
    int cur = 0;
    for (int i = 0; i < (int)s.length(); ++i) {
        if (s[i] == '(' || s[i] == 'R') ++cur;
        if (s[i] == ')' || s[i] == 'U') --cur;
        if (cur < 0) return false;
    }
    if (cur) return false;
    return true;
}

std::string trans(std::string s) {
    std::string res;
    for (int i = 0; i < (int)s.length(); ++i) {
        if (s[i] == '(') res += 'R';
        if (s[i] == ')') res += 'U';
        if (s[i] == 'R') res += '(';
        if (s[i] == 'U') res += ')';
    }
    return res;
}

int main() {
    std::string s;
    std::cin >> s;
    if (s == "path") {
        int n;
        read(n);
        std::string str;
        std::cin >> str;
        int pre = -1, suf = (int)str.length();
        for (int i = 0; i < (int)str.length(); ++i) {
            if (check(str.substr(0, i + 1))) pre = i;
        }
        if (pre == (int)str.length() - 1) {
            std::cout << trans(str) << std::endl << "0" << std::endl;
            return 0;
        }
        // printf("%d %d\n", pre, suf);
        int pos = 0;
        std::string ans;
        for (int i = suf - 1; i > pre; --i) {
            if (check(str.substr(i, suf - i) + str.substr(pre + 1, i - pre - 1))) {
                ans = str.substr(0, pre + 1) + str.substr(i, suf - i) + str.substr(pre + 1, i - pre - 1) + str.substr(suf, (int)str.length() - suf);
                pos = (pre + 1) / 2;
                for (int j = i; j < suf; ++j)
                    if (str[j] == 'U') ++pos;
                ++pos;
                break;
            }
        }
        std::cout << trans(ans) << std::endl << pos << std::endl;
    }
    else {
        int n;
        read(n);
        std::string str;
        std::cin >> str;
        int k;
        read(k);
        if (k == 0) {
            std::cout << trans(str) << std::endl;
            return 0;
        }
        int pos = 0;
        for (int i = 0; i < (int)str.length(); ++i) {
            if (str[i] == ')') --k;
            if (k == 0) {
                pos = i;
                break;
            }
        }
        int pre = -1, suf = (int)str.length();
        for (int i = 0; i < pos; ++i)
            if (check(str.substr(0, i + 1))) pre = i;
        std::string ans = str.substr(0, pre + 1) + str.substr(pos, suf - pos) + str.substr(pre + 1, pos - pre - 1) + str.substr(suf, (int)str.length() - suf);
        std::cout << trans(ans) << std::endl;
    }
    return 0;
}