DINIC模板

//#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;

const int INF=INT_MAX;
const int N=30005,M=N<<1;

int dis[N];
int m,n,s,t;

struct edge
{
    int to,next;
    long long value;
} E[M];
int cnt,head[N],cur[N];


void add(int from,int to,int value)
{
    E[cnt].to=to;
    E[cnt].value=value;
    E[cnt].next=head[from];
    head[from]=cnt++;
}

bool BFS()
{
    queue<int> Q;
    memset(dis,-1,sizeof(dis));
    Q.push(s);
    dis[s]=0;
    while(!Q.empty())
    {
        int x=Q.front(); Q.pop();
        for(int i=head[x]; i!=-1; i=E[i].next)
        {
            int now=E[i].to;
            if( dis[now]==-1 && E[i].value )
            {
                dis[now]=dis[x]+1;
                Q.push(now);
                if(now==t) return true;
            }
        }
    }
    return dis[t]!=-1;
}

long long DFS(int x,int maxflow)
{
    if(x==t) return maxflow;
    long long ans=0;
    for(int i=cur[x];i!=-1;i=E[i].next)
    {
        int now=E[i].to;
        if(dis[now]!=dis[x]+1 || !E[i].value ||ans >=maxflow)
            continue;
        cur[x]=i;
        int f=DFS(now, min(maxflow-ans,E[i].value));
        E[i].value-=f;
        E[i^1].value+=f;
        ans+=f;
    }
    return ans;
}
long long Dinic()
{
    long long sum=0;
    while(BFS())
    {
        memcpy(cur,head,sizeof(head));
        sum+=DFS(s,INF);
    }
    return sum;
}

int main()
{
    ios::sync_with_stdio(false);
    //int T;
    //cin>>T;
    //while(T--)
    //{
        memset(head,-1,sizeof(head));
        cnt=0;
        scanf("%d%d",&m,&n);
        s=0;t=m+n+1;
        //构图
        cout<<Dinic()<<endl;
    //}
    return 0;
}