using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Long();
            var q = sc.Integer();
            var xs = new List<long>();
            int[] Q = new int[q]; ;
            long[] L = new long[q];
            long[] R = new long[q];
            for (int i = 0; i < q; i++)
            {
                Q[i] = sc.Integer();
                L[i] = sc.Long();
                R[i] = sc.Long() + 1;
                xs.Add(L[i]);
                xs.Add(R[i]);
            }
            xs = xs.Distinct().ToList();
            xs.Sort();
            var l = new int[q];
            var r = new int[q];
            for (int i = 0; i < q; i++)
            {
                l[i] = xs.BinarySearch(L[i]);
                r[i] = xs.BinarySearch(R[i]);
            }
            var m = 1;
            while (m < xs.Count - 1) m <<= 1;
            var count = new long[m << 1];
            for (int i = 0; i < xs.Count - 1; i++)
                count[m + i] = xs[i + 1] - xs[i];
            for (int i = m - 1; i >= 1; i--)
                count[i] = count[i * 2] + count[i * 2 + 1];
            var sum = new long[5];
            var tree = Enumerate(5, x => new LazyEvaluateSetSumTree(xs.Count, count));
            const long mod = (long)(1e18) + 9;
            for (int i = 0; i < q; i++)
            {
                if (Q[i] == 0)
                {
                    var val = new long[5];
                    for (int j = 0; j < 5; j++)
                        val[j] = tree[j].Query(l[i], r[i]);
                    long max = -1; var id = -1;
                    for (int j = 0; j < 5; j++)
                    {
                        if (max < val[j]) { max = val[j]; id = j; }
                        else if (max == val[j]) { id = -1; }
                    }
                    if (id >= 0)
                        sum[id] = (sum[id] + max) % mod;

                }
                else
                {
                    for (int j = 0; j < 5; j++)
                    {
                        if (Q[i] - 1 == j)
                        {
                            tree[j].Add(l[i], r[i], 1);
                            //Debug.WriteLine(tree[j].Query(l[i], r[i]));
                        }
                        else tree[j].Reset(l[i], r[i]);
                    }
                }
            }
            for (int i = 0; i < 5; i++)
                sum[i] = (sum[i] + tree[i].Query(0, 10000000)) % mod;

            IO.Printer.Out.WriteLine(sum.AsJoinedString());
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region otaku tree
public class LazyEvaluateSetSumTree
{
    int n;
    long[] data;
    long[] val;
    long[] cnt;
    int[] lazy;
    bool[] go;
    public LazyEvaluateSetSumTree(int size, long[] count)
    {
        n = 1;
        while (n < size)
            n <<= 1;
        data = new long[n << 1];
        val = new long[n << 1];
        cnt = count;
        lazy = new int[n << 1];
        go = new bool[n << 1];
    }

    public void Reset(int a, int b)
    {
        Reset(a, b, 1, 0, n);
    }
    public void Reset(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            go[k] = true;
            val[k] = 0;
            data[k] = 0;
            lazy[k] = 0;
        }
        else
        {
            lazyEval(k, l, r);
            Reset(a, b, k << 1, l, (l + r) >> 1);
            Reset(a, b, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    private void lazyEval(int k, int a, int b)
    {
        if (go[k])
        {
            Reset(a, (a + b) >> 1, k << 1, a, (a + b) >> 1);
            Reset((a + b) >> 1, b, (k << 1) + 1, (a + b) >> 1, b);
            go[k] = false;
        }
        if (lazy[k] >= 0)
        {
            Add(a, (a + b) >> 1, lazy[k], k << 1, a, (a + b) >> 1);
            Add((a + b) >> 1, b, lazy[k], (k << 1) + 1, (a + b) >> 1, b);
            val[k] = 0;
        }
        lazy[k] = 0;
    }
    private void eval(int k)
    {
        int l = k << 1, r = (k << 1) + 1;
        data[k] = val[k] * cnt[k] + data[l] + data[r];
    }
    public void Add(int a, int b, int v)
    {
        Add(a, b, v, 1, 0, n);
    }
    private void Add(int a, int b, int v, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            if (go[k] && k < n)
            {
                Reset(a, (a + b) >> 1, k << 1, a, (a + b) >> 1);
                Reset((a + b) >> 1, b, (k << 1) + 1, (a + b) >> 1, b);
                go[k] = false;
            }
            lazy[k] += v;
            val[k] += v;
            data[k] += v * cnt[k];

        }
        else
        {
            lazyEval(k, l, r);
            Add(a, b, v, k << 1, l, (l + r) >> 1);
            Add(a, b, v, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    public long Query(int a, int b) { return Query(a, b, 1, 0, n); }
    private long Query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return 0;
        if (a <= l && r <= b)
            return data[k];
        else
        {
            lazyEval(k, l, r);
            var vl = Query(a, b, k << 1, l, (l + r) >> 1);
            var vr = Query(a, b, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
            return vl + vr;
        }
    }

}
#endregion