#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m;//n行m列 
	int a[105][105],b[105][105]; 
	//输入 
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>a[i][j];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>b[i][j]; 
	//计算相似度
	int cnt=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(a[i][j]==b[i][j])
				cnt++;
	//输出
	cout<<fixed<<setprecision(2)<<cnt*100.0/(n*m)<<"\n"; 
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int m, n;
int a[105][105], b[105][105];
int main()
{
    cin >> m >> n;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++)
            cin >> a[i][j];
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++)
            cin >> b[i][j];
    int sam = 0;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++)
            if (a[i][j] == b[i][j])
                sam++;
    cout << fixed << setprecision(2) << sam * 100.0 / (n * m) << "\n";
    return 0;
}