#include <iostream>

#include <iostream>

#include <algorithm>

#include <cstdio>

#include <math.h>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <string.h>

#include <bitset>

#define REP(i,a,n) for(int i=a;i<=n;++i)

#define PER(i,a,n) for(int i=n;i>=a;--i)

#define hr putchar(10)

#define pb push_back

#define lc (o<<1)

#define rc (lc|1)

#define mid ((l+r)>>1)

#define ls lc,l,mid

#define rs rc,mid+1,r

#define x first

#define y second

#define io std::ios::sync_with_stdio(false)

#define endl '\n'

#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<' ';hr;})

using namespace std;

typedef long long ll;

typedef pair<int,int> pii;

const int P = 1e9+7, INF = 0x3f3f3f3f;

ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}

ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}

ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}

inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}

//head

#ifdef ONLINE_JUDGE

const int N = 1e6+10;

#else

const int N = 111;

#endif

int n, L[N], R[N];

ll fac[N];

char s[N];

int C(int n, int m) {

	if (n<m) return 0;

	return fac[n]*inv(fac[m])%P*inv(fac[n-m])%P;

}

int main() {

	fac[1]=1;

	REP(i,2,N-1) fac[i]=fac[i-1]*i%P;

	scanf("%s", s+1);

	n = strlen(s+1);

	REP(i,1,n) L[i]=L[i-1]+(s[i]=='(');

	PER(i,1,n) R[i]=R[i+1]+(s[i]==')');

	ll ans = 0;

	REP(i,1,n) if (s[i]=='(') {

		ans+=C(L[i]+R[i]-1,L[i]);

	}

	printf("%lld\n", ans%P);

}