// 题目：蜡烛之间的盘子个数问题

#include <iostream>

using namespace std;

typedef pair<int, int> PII;

const int N = 100010;

char p[N];
PII index[N];
int idx;               // idx表示当前指向第idx个蜡烛

int main()
{
    int n, m;
    cin >> n >> m;

    for(int i = 0; i < n; i ++ ) scanf("%s", &p[i]);


    int crayon = 0;
    for(int l = 0, r = 0; r < n; r ++ )
    {    
        if(p[r] == '|')
        {
            crayon ++;
            if(crayon == 2)
            {
                index[idx].first = l, index[idx ++ ].second = r;
                crayon --;
            }
            l = r;
        }
    }

    while(m --)
    {
        int l, r;
        cin >> l >> r;

        int total = 0;

        for(auto t : index)
        {
            if(l <= t.first && r >= t.second) total += t.second - t.first - 1;
            if(r < t.second || r <= t.first) break;
        }

        printf("%d ", total);
    }
}