#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
 
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
#define y1 y1228
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
using ll = long long;
using ld = long double;

// const int MAXMEM = 200 * 1000 * 1024;
// char _memory[MAXMEM];
// size_t _ptr = 0;
// void* operator new(size_t _x) { _ptr += _x; return _memory + _ptr - _x; }
// void operator delete (void*) noexcept {}
const string FILENAME = "input";

template<class iterator> void output(iterator begin, iterator end, ostream &out = cerr) {
	while (begin != end) {
		out << (*begin) << " ";
		begin++;
	}
	out << endl;
}




string toskob(string s) {
	string f;
	for (int i = 0; i < sz(s); i++) {
		if (s[i] == 'R') {
			f += '(';
		} else {
			f += ')';
		}
	}
	return f;
}



int exid(string s) {
	int f = 0;
	int cnt = 0;
	for (int i = 0; i < sz(s); i++) {
		bool t = f < 0;
		if (s[i] == 'R') {
			f++;
		} else {
			f--;
		}
		if (f < 0 || t) {
			cnt++;
		}
	}
	return cnt / 2;
}
 
string decrease(string s) {
	int bal = 0;
	for (int i = 0; i < sz(s); i++) {
		bool bad = false;
		if (bal < 0) {
			bad = true;
		}
		if (s[i] == 'R') {
			bal++;
		} else {
			bal--;
		}
		if (bad && bal == 0) {
			string k;
			for (int j = i + 1; j < sz(s); j++) {
				k += s[j];
			}
			k += s[i];
			for (int j = 0; j < i; j++) {
				k += s[j];
			}
			return k;
		}
	}
	return s;
}



string increase(string s) {
	int bal = 0;
	int last = -1;
	for (int i = 0; i < sz(s); i++) {
		bool bad = false;
		if (bal == 0) {
			bad = true;
		}
		if (s[i] == 'R') {
			bal++;
		} else {
			bal--;
		}
		if (bad && bal == 1) {
			last = i;
		}
	}
	if (last == -1) {
		return s;
	}
	string k;
	for (int j = last + 1; j < sz(s); j++) {
		k += s[j];
	}
	k += s[last];
	for (int j = 0; j < last; j++) {
		k += s[j];
	}
	return k;
}


string fromskob(string s) {
	string f;
	for (int i = 0; i < sz(s); i++) {
		if (s[i] == '(') {
			f += 'R';
		} else {
			f += 'U';
		}
	}
	return f;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  	//read(FILENAME);     
  	string s;
  	cin >> s;
  	if (s == "path") {
  		int n;
  		cin >> n;
  		string s;
  		cin >> s;
  		int cnt = 0;
  		//cout << exid(s) << endl;
  		while (exid(s) != 0) {
  			s = decrease(s);
  			cnt++;
  		}
  		cout << toskob(s) << endl;
  		cout << cnt << endl;
  	} else {
  		int n;
  		cin >> n;
  		string s;
  		cin >> s;
  		s = fromskob(s);
  		int cnt;
  		cin >> cnt;
  		while (exid(s) != cnt) {
  			s = increase(s);
  		}
  		cout << s << endl;
  	}
    return 0;
}