#include #include int main() { int n, m; scanf("%d%d", &n, &m); int i; int r = 1; int v = 0, vn; int c[100005]; char l[20]; for (i = 0; i < n; i++) c[i] = 0; int now = 0; for (i = 0; i < m; i++) { scanf("%s", l); if (l[strlen(l) - 2] == 'e') { if (v == 0) c[now]++; else { c[now] -= v; v = 0; now = (now + r + n) % n; c[now]++; } } else if (l[strlen(l) - 2] == 'w') { if (v == 0) { c[now]++; v += 2; vn = 2; } else if (vn == 2) { c[now]++; v += 2; } else { c[now] -= v; v = 2; vn = 2; now = (now + r + n) % n; c[now]++; } } else if (l[strlen(l) - 2] == 'u') { if (v == 0) { c[now]++; v += 4; vn = 4; } else if (vn == 4) { c[now]++; v += 4; } else { c[now] -= v; v = 4; vn = 4; now = (now + r + n) % n; c[now]++; } } else if (l[strlen(l) - 2] == 'i') { if (v == 0) { c[now]++; now = (now + r + n) % n; } else { c[now] -= v; v = 0; now = (now + r + n) % n; c[now]++; now = (now + r + n) % n; } } else { if (v == 0) { c[now]++; r *= -1; } else { c[now] -= v; v = 0; now = (now + r + n) % n; c[now]++; r *= -1; } } now = (now + r + n) % n; } now = (now - r + n) % n; printf("%d %d\n", now + 1, c[now]); return 0; }