//  C
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 5005;int len, l[N], r[N];
char s[N];
int main()
{scanf("%s", s+1);len = strlen(s+1);rep(i,1,len){r[i] = len+1;int cnt = 0;rep(j,i,len){if(s[j]==')') --cnt;else ++cnt;if(cnt<0) { r[i]=j; break; }}}per(i,len,1){l[i] = 0;int cnt = 0;per(j,i,1){if(s[j]=='(') --cnt;else ++cnt;if(cnt<0) { l[i]=j; break; }}}ll  ans = 0;rep(i,1,len){for(int j=i+1; j<=len; j+=2){if(r[i]>j && l[j]<i) ++ans;}}printf("%lld\n", ans);return 0;
}

//  D
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 105;int n, m, G[N][N], dp[N][N][30], mx[N];
int solve(int i, int j, int pre)
{if(dp[i][j][pre]!=-1) return dp[i][j][pre];if(i==j)  return dp[i][j][pre]=0;if(mx[i]==-1) return dp[i][j][pre]=0;if(mx[i] > mx[j]) return dp[i][j][pre]=1;else{rep(to,1,n)if(G[i][to]!=-INF && G[i][to]>=pre){if(solve(j, to, G[i][to])==0) return dp[i][j][pre]=1;}}return dp[i][j][pre]=0;
}
int main()
{scanf("%d%d", &n, &m);mes(dp, -1);  mes(mx, -1);rep(i,1,n) rep(j,1,n) G[i][j]=-INF;int u, v;  char ch;rep(i,1,m){scanf("%d%d%*c%c", &u, &v, &ch);G[u][v] = ch-'a'+1;}rep(i,1,n){int mx1=-1;rep(j,1,n) mx1=max(mx1, G[i][j]);mx[i] = mx1;}rep(i,1,n){rep(j,1,n)if(solve(i, j, 0)) putchar('A');else putchar('B');puts("");}return 0;
}