#include <bits/stdc++.h>
using namespace std;
int curTime, n, q, li[100005], ri[100005], Next[100005], Prev[100005],
    ans[100005], first_visit[100005];
int tree[4 * 100005], sum[100005];
char s[100005];
bool vis[100005];
vector<int> d;
vector<pair<vector<int>, int> > c;
struct Query {
  int li, ri, index;
  Query(int a, int b, int c) {
    li = a;
    ri = b;
    index = c;
  }
};
vector<Query> v[100005 * 20];
int find_sum(int i) {
  i++;
  int ret = 0;
  while (i > 0) {
    ret += sum[i];
    i -= i & (-i);
  }
  return ret;
}
void add(int i, int val) {
  i++;
  while (i < 100005) {
    sum[i] += val;
    i += i & (-i);
  }
}
int move(int x, int dir) {
  if (dir == 1) {
    int L = x, R = n;
    while (L < R) {
      int mid = (L + R) / 2;
      if (find_sum(mid) > find_sum(x))
        R = mid;
      else
        L = mid + 1;
    }
    return L;
  } else {
    int L = 0, R = x - 1;
    while (L < R) {
      int mid = (L + R + 1) / 2;
      if (find_sum(mid - 1) < find_sum(x - 1))
        L = mid;
      else
        R = mid - 1;
    }
    return L;
  }
}
void update(int i, int L, int R, int ind, int val) {
  if (ind < L || R < ind) return;
  if (L == R) {
    tree[i] = val;
    return;
  }
  int mid = (L + R) / 2;
  update(2 * i, L, mid, ind, val);
  update(2 * i + 1, mid + 1, R, ind, val);
  tree[i] = min(tree[2 * i], tree[2 * i + 1]);
}
int query(int i, int L, int R, int u, int v) {
  if (u <= L && R <= v) return tree[i];
  if (v < L || R < u) return 1 << 30;
  int mid = (L + R) / 2;
  return min(query(2 * i, L, mid, u, v), query(2 * i + 1, mid + 1, R, u, v));
}
int main() {
  scanf("%d %d %s", &n, &q, s + 1);
  s[0] = s[++n] = '#';
  for (int i = 0; i <= n; i++) Next[i] = Prev[i] = i;
  d.resize(10);
  memset(first_visit, 63, sizeof first_visit);
  for (int i = 0; i <= n; i++) add(i, 1);
  for (int start = 1; start < n; start++) {
    if (!vis[start]) {
      int x = start, dir = 1;
      while (start <= x && x < n) {
        first_visit[x] = min(first_visit[x], (int)c.size());
        c.push_back(make_pair(d, x));
        vis[x] = true;
        if ('0' <= s[x] && s[x] <= '9') {
          d[s[x] - '0']++;
          if (s[x] == '0')
            add(x, -1);
          else
            s[x]--;
        } else {
          if (s[x] == '<') {
            dir = -1;
            if (s[move(x, dir)] == '>' || s[move(x, dir)] == '<') add(x, -1);
          } else {
            dir = 1;
            if (s[move(x, dir)] == '<' || s[move(x, dir)] == '>') add(x, -1);
          }
        }
        x = move(x, dir);
      }
      c.push_back(make_pair(d, x));
    }
  }
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &li[i], &ri[i]);
    int ti = first_visit[li[i]];
    v[ti].push_back(Query(li[i], ri[i], i));
  }
  memset(tree, 63, sizeof tree);
  for (int i = c.size() - 1; i >= 0; i--) {
    for (int j = 0; j < v[i].size(); j++)
      ans[v[i][j].index] = min(query(1, 0, n, 0, v[i][j].li - 1),
                               query(1, 0, n, v[i][j].ri + 1, n));
    update(1, 0, n, c[i].second, i);
  }
  for (int i = 0; i < q; i++) {
    for (int j = 0; j < 10; j++) {
      if (j > 0) printf(" ");
      printf("%d", c[ans[i]].first[j] - c[first_visit[li[i]]].first[j]);
    }
    printf("\n");
  }
  return 0;
}
