test

#include<stdio.h>
#define N 26
char g[N][N], c;
int n, m, vis[N][N];
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};

void dfs(int x, int y)
{
    vis[x][y] = 1;
    for (int i = 0; i < 4; i ++)
    {
        int nx = x + dx[i], ny = y + dy[i];
        if(nx < 0 || nx >= n || ny < 0 || ny >= m || g[nx][ny] != '1' || vis[nx][ny])continue;
        dfs(nx, ny);
    }
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i ++)
    {
        scanf("%c", &c);
        for(int j = 0; j < m; j ++)
            scanf("%c", &g[i][j]);
    }
    
    int ans = 0;
    for(int i = 0; i < n; i ++)for(int j = 0; j < m; j ++)if(g[i][j] == '1' && !vis[i][j])
    {
        ans ++;
        dfs(i, j);
    }
    printf("%d", ans);
    
    return 0;
}