1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<cmath>
 5 using namespace std;
 6 const int maxx=0x7fffffff;
 7 int n,m,x,y,ans;int tot;
 8 struct wakaka{
 9     int to,next,v;
10 }e[40010];
11 int ha[210],queue[210],head[210],father[210];
12 void addedge(int u,int v,int w){
13     tot++;e[tot].to=v;e[tot].v=w;e[tot].next=head[u];head[u]=tot;
14     tot++;e[tot].to=u;e[tot].next=head[v];head[v]=tot;
15 }
16 bool bfs(){
17     int now,t=0,w=1,p,i;
18     memset(ha,-1,sizeof(ha));
19     queue[t]=ha[0]=0;
20     while (t<w){
21         now=queue[t];
22         t++;
23         i=head[now];
24         while(i){
25             if (e[i].v&&ha[e[i].to]<0){
26                 queue[w++]=e[i].to;
27                 ha[e[i].to]=ha[now]+1;
28             }
29             i=e[i].next;
30         }
31     }
32     if (ha[n+1]==-1) return 0;
33     else
34     return 1;
35 }
36 int dfs(int x,int maxx){
37     if(x==n+1)return maxx;
38     int i=head[x];
39     int w,used=0;
40     while(i)
41     {
42             if(e[i].v&&ha[e[i].to]==ha[x]+1)
43             {
44                 w=maxx-used;
45                 w=dfs(e[i].to,min(w,e[i].v));
46                 //if (w!=0) father[x]=e[i].to;
47                 e[i].v-=w;
48                 e[i^1].v+=w;
49                 used+=w;
50                 if(used==maxx)return maxx;
51                 }
52                 i=e[i].next;
53     }
54     if(used==0)ha[x]=-1;
55     return used;
56 }
57
58
59 int main(){
60     tot=1;
61     scanf("%d %d",&m,&n);
62     scanf("%d %d",&x,&y);
63     while (x!=y and x!=-1){
64         addedge(x,y,1);
65         scanf("%d %d",&x,&y);
66     }
67     for(int i=1;i<=n;++i){
68         if (i<=m)
69             addedge(0,i,1);
70         else
71             addedge(i,n+1,1);
72     }
73     while(bfs())ans+=dfs(0,maxx);
74     if (ans!=0)
75     {printf("%d\n",ans);
76       //for (int i=1;i<=m;++i)
77       //if (father[i])
78       //printf("%d %d\n",i,father[i]);
79     }
80     else
81     printf("No Solution!");
82     return 0;
83 }