package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	m := getNextInt(scanner)
	cc := make([]int, n)
	ll := make([]string, m)
	p := 0
	d := 1
	for i := 0; i < m; i++ {
		ll[i] = getNextString(scanner)
	}
	last := 0
	for i := 0; i < m; i++ {
		last = p
		cc[p]--
		switch ll[i] {
		case "number":
			p = mod(p+d, n)
		case "drawtwo":
			c := 2
			p = mod(p+d, n)
			for i+1 < m && ll[i+1] == "drawtwo" {
				last = p
				cc[p]--
				p = mod(p+d, n)
				i++
				c += 2
			}
			cc[p] += c
			p = mod(p+d, n)
		case "drawfour":
			c := 4
			p = mod(p+d, n)
			for i+1 < m && ll[i+1] == "drawfour" {
				last = p
				cc[p]--
				p = mod(p+d, n)
				i++
				c += 4
			}
			cc[p] += c
			p = mod(p+d, n)
		case "skip":
			p = mod(p+d*2, n)
		case "reverse":
			d *= -1
			p = mod(p+d, n)
		}
	}
	fmt.Fprintln(writer, fmt.Sprintf("%d %d", last+1, -cc[last]))
}

func mod(p, n int) int {
	p %= n
	if p < 0 {
		p += n
	}
	return p
}