#include <iostream>
#include <stdio.h>
using namespace std;

int n,m;
int NEXT[500011];
int PREV[500011];
int seq[500011];
int L=0;


int IT[2000001];
int LEAFOFFSET=1;

inline int MAX(int a,int b)
{
    if (a>b)
    return a;
    else
    return b;
}

int GetRec(int ver,int L,int R,int l,int r)
{
    if (L>r || R<l)
    return 0;
    else if (L>=l && R<=r)
    {
        return IT[ver];
    }
    else
    {
        return MAX( GetRec(2*ver,L,(L+R)/2,l,r) , GetRec(2*ver+1,(L+R)/2+1,R,l,r) );
    }
}

int Get(int k)
{
    return GetRec(1,1,LEAFOFFSET+1,k,n);
}

void Update(int ver,int val)
{
    ver+=LEAFOFFSET;
    IT[ver]=val;
    ver/=2;

    while(ver!=0)
    {
        IT[ver]=MAX(IT[2*ver],IT[2*ver+1]);
        ver/=2;
    }

    return;
}

int main()
{
    freopen("sequence.in","r",stdin);
    freopen("sequence.out","w",stdout);

    int a,b,c;
    int i;
    int NX,PV;
    int Val;

    scanf("%d %d",&n,&m);

    LEAFOFFSET=1;
    while(LEAFOFFSET<n)
    LEAFOFFSET*=2;
    LEAFOFFSET--;

    NEXT[0]=1;
    PREV[n+1]=n;
    for (i=1;i<=n;i++)
    {
        NEXT[i]=i+1;
        PREV[i]=i-1;
    }

    for (i=1;i<=m;i++)
    {
        scanf("%d %d %d",&a,&b,&c);

        b++;
        c++;

        if (a==1)
        {
            NX=NEXT[b];
            PV=PREV[b];

            NEXT[PV]=NX;
            PREV[NX]=PV;

            NEXT[b]=NEXT[c];
            PREV[b]=c;

            PREV[ NEXT[c] ]=b;
            NEXT[c]=b;
        }
        else
        {
            NX=NEXT[b];
            PV=PREV[b];

            NEXT[PV]=NX;
            PREV[NX]=PV;

            NEXT[b]=c;
            PREV[b]=PREV[c];

            NEXT[ PREV[c] ]=b;
            PREV[c]=b;
        }
    }

    for (i=NEXT[0];i!=n+1;i=NEXT[i])
    {
        L++;
        seq[L]=i;
    }

    for (i=1;i<=n;i++)
    {
        Val=Get(seq[i]+1);

        Update(seq[i],Val+1);
    }

    Val=Get(1);

    printf("%d\n",n-Val);

    return 0;
}