#include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 #include <algorithm>
 #include <queue>
 #include <deque>
 #include <queue>
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
 #include <utility>
 #include <functional>
 #include <fstream>
 #include <iomanip>
 #include <sstream>
 #include <numeric>
 #include <cassert>
 #include <ctime>
 #include <iterator>
 const int INF = 0x3f3f3f3f;
 ][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};
 using namespace std;
 ], b[];
 //#define LL long long
 #define LL __int64
 int main(void)
 {
     #ifndef ONLINE_JUDGE
     freopen("in.txt", "r", stdin );
     #endif // ONLINE_JUDGE
     while (~scanf("%s", a))
     {
         int n; scanf("%d", &n);
         ;
         LL ans = , bns = ;
         scanf("%d%d", &pl, &pr);
         bns += (pr - pl + );
         ans += (pr - pl +  + );
         ; so < n-; ++so)
         {
             scanf("%d%d", &l, &r);
             bns += (r - l + );
             tmp = ; int pos = pl, i;
             for (i = l; i < r && pos < pr; ++i)
             {
                 if (a[i] == a[pos]) tmp++, pos++;
                 else break;
             }
             sprintf(b, "%d", tmp);
             ans += strlen(b);
             ans += (r-l-(i-l)); ans += ;
             pl =l, pr = r;
         }
 //        printf("%lld %lld\n", bns, ans);
 //        printf("bns = %lld\n",bns);
 //        printf("ans = %lld\n",ans);
 //        printf("%lld %lld\n", bns, ans);
         cout << bns << " " << ans << endl;
     }
     ;
 }