#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 1e9

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int  maxn = ;

const int turn[][] = {{, }, { -, }, {, }, {, -}};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

int main()

{

        int ques = ;

        int l = ;

        int anser = ;

        string a;

        cin >> a;

        int len = a.size();

        for (int i = ; i < len - ; i++)

        {

                l = ;

                ques = ;

                for (int j = i; j < len; j++)

                {

                        int flag = ;

                        if (a[j] == ')')

                        {

                                l--;

                        }

                        else if (a[j] == '(')

                        {

                                l++;

                        }

                        else

                        {

                                ques++;

                                l--;

                        }

                        if (l < )

                        {

                                if (ques)

                                {

                                        while (l <  && ques)

                                        {

                                                l += ;

                                                ques--;

                                        }

                                }

                                else

                                {

                                        l = ;

                                        break;

                                }

                        }

                        if (l == )

                        {

                                //cout << i << " " << j << endl;

                                anser++;

                        }

                }

        }

        cout << anser << endl;

        return ;

}

#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 1e9

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

const double EPS = 1.0e-4;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int turn[][] = {{, }, { -, }, {, }, {, -}};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

vector<int> f[];

int dp[][][];

int gra[][];

int dfs(int x, int y, int now)

{

        if (dp[x][y][now] != -)

        {

                return dp[x][y][now];

        }

        int len = f[x].size();

        for (int i = ; i < len; i++)

        {

                int to = f[x][i];

                if (gra[x][to] >= now && dfs(y, to, gra[x][to]) == )

                {

                        dp[x][y][now] = ;

                        return ;

                }

        }

        return ;

}

int main()

{

        mem(dp, -);

        string a;

        int n, m;

        cin >> n >> m;

        for (int i = ; i <= m; i++)

        {

                char ch;

                int from, to;

                scanf("%d %d", &from, &to);

                cin >> a;

                f[from].pb(to);

                gra[from][to] = a[] - 'a';

        }

        for (int i = ; i <= n; i++)

        {

                for (int j = ; j <= n; j++)

                {

                        if (dfs(i, j, ))

                        {

                                cout << "A";

                        }

                        else

                        {

                                cout << "B";

                        }

                }

                cout << endl;

        }

        return ;

}