//////// From bqi343
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! //
// pairs
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
tcT> int upb(V<T>& a, const T& b) { return int(ub(all(a),b)-bg(a)); }
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = (int)1e9+7; // 998244353;
const int MX = (int)2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x))
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; } // set a = max(a,b)
tcTU> T fstTrue(T lo, T hi, U f) {
++hi; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
--lo; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo+1)/2;
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
auto it = t.find(u); assert(it != end(t));
t.erase(it); } // element that doesn't exist from (multi)set
ll M = 1000000007;
void test(string s){
// 3. and 4. subtask
ll total = 0;
ll prev_total = 0; // total for the previous sum;
ll prev_num_count = 0; // starting points for the previous sum, ie count of numbers.
ll curr_num = 0; // remembers the modulo of the current number
ll curr_num_total=0; // remembers the sum for current number ending at specific point
ll len_of_curr_num=0;
for (ll i=0; i<s.size(); ++i){
if (s[i]=='+'){
prev_total=(prev_total+ curr_num*prev_num_count+curr_num_total)%M;
curr_num=0;
curr_num_total=0;
prev_num_count+=len_of_curr_num;
len_of_curr_num=0;
}
else{
len_of_curr_num++;
curr_num = (curr_num*10)%M;
ll num = (ll)s[i]-48;
curr_num+=num;
curr_num_total = (curr_num_total*10)%M;
curr_num_total= (curr_num_total + num*len_of_curr_num)%M;
total = (total + curr_num_total + curr_num*prev_num_count+prev_total)%M;
//cout << num << " " << curr_num << " " << curr_num_total << " " << prev_total << " " << prev_num_count << " " << len_of_curr_num << "\n";
//cout << i << " " << curr << " " << total << "\n";
}
}
cout << total << "\n";
}
void test1(string s){
// 3. and 5. subtask
ll total = 0;
ll prev_total = 0; // total for the previous sum;
ll prev_num_count = 0; // starting points for the previous sum, ie count of numbers.
ll curr_num = 0; // remembers the modulo of the current number
ll curr_num_total=0; // remembers the sum for current number ending at specific point
ll len_of_curr_num=0;
for (ll i=0; i<s.size(); ++i){
if (s[i]=='*'){
prev_total=(prev_total*curr_num + curr_num_total)%M;
curr_num=0;
curr_num_total=0;
prev_num_count+=len_of_curr_num;
len_of_curr_num=0;
}
else{
len_of_curr_num++;
curr_num = (curr_num*10)%M;
ll num = (ll)s[i]-48;
curr_num+=num;
curr_num_total = (curr_num_total*10)%M;
curr_num_total= (curr_num_total + num*len_of_curr_num)%M;
total = (total + curr_num_total + prev_total*curr_num)%M;
//cout << num << " " << curr_num << " " << curr_num_total << " " << prev_total << " " << prev_num_count << " " << len_of_curr_num << "\n";
//cout << i << " " << curr << " " << total << "\n";
}
}
cout << total << "\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
//Check which code to use (4. or 5. subtask)
bool fourth = true;
for (auto u:s) if (u=='*') fourth = false;
if (fourth) test(s);
else test1(s);
}
