#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 100000+5

 #define maxm 500+100

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define for4(i,x) for(int i=head[x],y;i;i=e[i].next)

 #define mod 100007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m,b[maxn];

 struct rec{int x,y;}a[maxn];

 inline bool cmp(rec a,rec b){return a.x<b.x;}

 inline bool cmp1(int i,int j){return a[i].y<a[j].y;}

 struct bit

 {

     int s[maxn];

     inline void add(int x,int y)

     {

         y=(y%mod+mod)%mod;

         for(;x<=n;x+=x&(-x))(s[x]+=y)%=mod;

     }

     inline int sum(int x)

     {

         int t=;

         for(;x;x-=x&(-x))(t+=s[x])%=mod;

         return t;

     }

 }t[][];

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     n=read();m=read();

     for1(i,n)a[i].x=read(),a[i].y=read();

     sort(a+,a+n+,cmp);

     for1(i,n)b[i]=i;

     sort(b+,b+n+,cmp1);

     for1(i,n)a[b[i]].y=i;

     for1(i,n)

     {

      t[][].add(a[i].y,);t[][].add(a[i].y,);

      for1(j,m)

       {

            t[j][].add(a[i].y,t[j][].sum(n)-t[j][].sum(a[i].y)+t[j-][].sum(n)-t[j-][].sum(a[i].y));

            t[j][].add(a[i].y,t[j][].sum(a[i].y-)+t[j-][].sum(a[i].y-));

       }

     }

     printf("%d\n",(t[m][].sum(n)+t[m][].sum(n))%mod);

     return ;

 }